solve the attached question class is given template <class T>class ABList{private:int max_size;int actual_size;T* list_array;public:ABList(int Size);~ABList();int getLength();Page 2 of 3T getItem(int);void insertItem(T value);int findAndRemoveItem(T);void displayList();void MergeList(ABList);void ReducetoHalf();}; Q #1. Apply concepts of Advanced Data Structures to implement a template class forarray based list with following attributes and functionalities:template class I>class ABListiprivate:int max_sise:int actual_sise:I* list_array:public:ABList (int Sise):ABList ():int getlength () :Page 1 of 3I getItem (int):void insertItem (T value):int findandRemove Item (T) :void displayList ():void Mergelist (ABList):void ReducetoHalf ():Constructor will dynamically allocate the list of size 'Size'.• insertitem() function will insert new item at the end of the list, only if item is notpresent in the list already. If item is already present, it will display a message,'Item already in the list.• FindAndRemoveltem) will search an item in the list, if found, item will be removedfrom the list. If item is not found, function will retum -1.ReducetoHalf) will reduce the size of the List to half and copy all the items from the oldlist to the new list and destroy the old list.• MergeLists() will combine two array based lists into one.• n main(), define two array based lists of type String and size 10. Ask user toenter 5 names in each of the lists. Merge both the lists and display the resultantmerged list on the screen.

#include<iostream> using namespace std; template <class T>class ABList{ private:…

solve the attached question class is given template class ABList{ private: int max_size; int actual_size; T* list_array; public: ABList(int Size); ~ABList(); int getLength(); Page 2 of 3 T getItem(int); void insertItem(T value); int findAndRemoveItem(T); void displayList(); void MergeList(ABList); void ReducetoHalf(); };

solve the attached question class is given template class ABList{ private: int max_size; int actual_size; T* list_array; public: ABList(int Size); ~ABList(); int getLength(); Page 2 of 3 T getItem(int); void insertItem(T value); int findAndRemoveItem(T); void displayList(); void MergeList(ABList); void ReducetoHalf(); };

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 15PE

See similar textbooks

Similar questions

in c++ please A LinkNode structure or class which will have two attributes - a data attribute, and a pointer attribute to the next node. The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2. Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below. A SinglyLinkedList class which will be composed of three attributes - a count attribute, a LinkNode pointer/reference attribute named as and pointing to the start of the list and a LinkNode pointer/reference attribute named as and pointing to the end of the list. Since this is a class, make sure all these attributes are private. The class and attribute names for the node and linked list are the words in bold in #1 and #2. For the Linked List, implement the following linked-list behaviors as explained in class - getters/setters/constructors/destructors, as needed, for the attributes of the class. createList method in addition to the constructor - this is…
Q #1. Apply concepts of Advanced Data Structures to implement a template class forarray based list with following attributes and functionalities:template <class T>class ABList{private:int max_size;int actual_size;T* list_array;public:ABList(int Size);~ABList();int getLength(); Page 2 of 3 T getItem(int);void insertItem(T value);int findAndRemoveItem(T);void displayList();void MergeList(ABList);void ReducetoHalf();};• Constructor will dynamically allocate the list of size ‘Size’.• insertItem() function will insert new item at the end of the list, only if item is notpresent in the list already. If item is already present, it will display a message,‘Item already in the list’.• FindAndRemoveItem() will search an item in the list, if found, item will be removedfrom the list. If item is not found, function will return -1.• ReducetoHalf() will reduce the size of the List to half and copy all the items from the oldlist to the new list and destroy the old list.• MergeLists() will combine…
This two question in data structures : Q1: Compare between array based data structures and linked based data structures ? Q2. The class list was implemented on singular linked list. Re-implement it on doubly linked list take in account the set-position method and the operator overload and coy constructor and destructor ? in c++
Topical Information Use C++. The purpose of this project is to test your ability to use templates, dynamic memory (mixed with classes), operator overloading, and libraries effectively in program design. Program Information Create a template class for a dynamic 1D array. You can model your class off of our String class or the dynamic list class. Changes from String class: You won't need an end-of-string element in the array. The element type is now templated. Translation will no longer be necessary. operators - and -= 'might' now make sense (erase element(s)?). ... Show how useful your template array class is by creating arrays of short integers doubles String class objects (static) Point class objects pointers to Point class objects (each allocated on the heap) — all in one test application. Make sure your test application is a good/thorough test of your class. (Your test application might utilize the applyand accumulatefunctions from lecture to facilitate testing. Also note how a…
Can you please help me with these three questions? 1) A designator used to give a non-member function in C++ access to the private data members of a class, even though the function is not technically part of the class, is called ______ 2) The stack operation that is required when using an array implementation, but is not required when using a linked list implementation, is ___ . isFull() push() pop() peek() 3) A mechanism in C++ that interrupts program execution when errors occur and signals the rest of the program that something unexpected has happened is a(n) ___ . exception logic error catch phrase interception
C++ Write a class template that uses a vector to implement a stack data structure with these member functions: 1. (constructor) : Construct stack (public member function ) 2. empty : Test whether container is empty (public member function ) 3. size : Return size (public member function ) 4. top : Access next element (public member function ) 5. push : Insert element (public member function ) 6. pop : Remove top element (public member function ) Put function definitions outside the definition of the class (i.e. inline functions are not allowed).
Course: Data Structure and Algorithms Language: C++ Question is well explained Question #2Implement a class for Circular Doubly Linked List (with a dummy header node) which stores integers in unsorted order. Your class definitions should look like as shown below: class CDLinkedList;class DNode {friend class CDLinkedList;private int data;private DNode next;private DNode prev;};class CDLinkedList {private:DNode head; // Dummy header nodepublic CDLinkedList(); // Default constructorpublic bool insert (int val); public bool removeSecondLastValue (); public void findMiddleValue(); public void display(); };
5. Write a function logisticClassify that takes in the m feature values for the n data points as a np-array with dimensions (n,m) and the weight vector w as a np-array with dimension (m+1) (with b as the final element of w). The function returns the 0/1 label for each data point as a np-array of dimension (n). Use the following syntax: classLabels=logisticClassify(x,w)
A dequeue is a list from which elements can be inserted or deleted at either end a. Develop an array based implementation for dequeue. b. Develop a pointer based implementation dequeue.
Fortran, C++ and other languages use the assignment operator form like this: variable := expressions, but ALGOL 58 and Plankalkul used: used expression => variable form. Demonstrate using pseudo code how a C++ "linked" (link list) object would have to be modified to revert to the ALGOL 58 standard. HINT: think private member data, accessors and mutators etc. A. &Next <= alpha(A) B. alpha A &A=>&Next C. alpha * A; alpha B; A = new alpha; A->setnext(&B); D. alpha * Next; void setNext(alpha A) { &A => Next; }
Write Java code Objectives •Use an abstract data type for a list •Use a method that contains an Object type as a formal parameter •Use methods in an existing class •Access data members within a class Required Files: •ListInterface.java •ListException.java •ListOutOfBoundsException.java •ListArrayBased.java Description A list is an abstract data type used to store ordered data, and contains operations that fall into the following categories: (1) add data to a data collection, (2) remove data from a data collection, and (3) ask questions about data in a data collection. The operations which ask questions about the data in a data collection may include operations that determine if a data collection is empty, determine the size of a data collection, and retrieve the item at a given position in a data collection. A list should be able to contain any type of object. The methods for the List support any object as specified in the interface. In this assignment, the objects will be S trings.…
C++ Programming D.S.Malik12-10: Add the function max as an abstract function to the class arrayListType to return the largest element of the list. Also, write the definition of the function max in the class unorderedArrayListType and write a program to test this function.