Q #3. Implement a template class named 'AllpurposeListť. Define and implement the following attributes and functionalities for the class : (20 Points) • Class will have data member named 'Size' and a pointer to the list. • Constructor will dynamically create an array of size 'Size' given by the user. Destructor will delete the dynamically created list. • Define SetData () function to take input from the user and fill the list. Define DisplayData () Function to display the List Data on screen. • Define a function SearchItem) to search an item given by the user in the list and return its index if present, otherwise return -1. • In main() define ´AllpurposeList as 'float and ´string'. For each case, take input from user to fill the list, search an item given by the user in the list and display its index on the screen, if present.

Q #3. Implement a template class named 'AllpurposeListť. Define and implement the following attributes and functionalities for the class : (20 Points) • Class will have data member named 'Size' and a pointer to the list. • Constructor will dynamically create an array of size 'Size' given by the user. Destructor will delete the dynamically created list. • Define SetData () function to take input from the user and fill the list. Define DisplayData () Function to display the List Data on screen. • Define a function SearchItem) to search an item given by the user in the list and return its index if present, otherwise return -1. • In main() define ´AllpurposeList as 'float and ´string'. For each case, take input from user to fill the list, search an item given by the user in the list and display its index on the screen, if present.

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

Implement a class representing a circular sorted linked list. The class must have the following requirements: The linked list and the nodes must be implemented as C++ templates First must point to the largest value in the list It must include a constructor, a destructor, a copy constructor and an operator= It must include functions to insert a given item, delete a given item, search for a given item, check if the list is empty, return the length of the list and print the list (from smallest to largest) Hint: Use the menu-driven program of the linked list to test all the functions in your class. Screenshot the output and make comments on each area on the program.
Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linkedlist. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If nosuch element exists, output an appropriate message. Provide the definitions of these functions in the class linkedListType. Also writea program to test these functions. (Use either the classunorderedLinkedList or the class orderedLinkedList to testyour function.) Note: Code in c++
in c++ . Create a class IntegerSet for which each object can hold integers in the range 0 through 100. A set is represented internally as an array of ones and zeros. Array element a[ i ] is 1 if integer i is in the set. Array element a[ j ] is 0 if integer j is not in the set. • The default constructor initializes a set to the so-called “empty set,” i.e., a set whose array representation contains all zeros. • Provide member functions for the common set operations. For example, provide a unionOfSets member function that creates a third set that is the settheoretic union of two existing sets (i.e., an element of the third set’s array is set to 1 if that element is 1 in either or both of the existing sets, and an element of the third set’s array is set to 0 if that element is 0 in each of the existingsets). Provide an intersectionOfSets member function which creates a third set which is the set theoretic intersection of two existing sets (i.e., an element of the third set’s array is set…
Create a simple “shape” hierarchy: a base class called Shape and derived classes called Circle, Square, and Triangle. In the base class, make a virtual function called draw(), and override this in the derived classes. Make an array of pointers to Shape objects that you create on the heap (and thus perform up casting of the pointers), and calldraw() through the base-class pointers, to verify the behavior of the virtual function if your debugger supports it, single-step through the code. The subject is OOP(Object oriented programming) The code should be in C++
Write a class template List with one type parameter and one nontype parameter. Provide complete definition of members to correctly execute the following main. int main() { double values[5] = {10.1, 11.2, 12.3, 13.4, 14.5} ; // Use this array to initialize dList List< double , 5 > dList(values); // Define a constructor receiving array for initialization dList.subtract(1.1); // Subtracts 1.1 from the value of each element of dList dList.show(); // Displays all elements of dList return 0; } // end main
Create class IntegerSet for which each object can hold integers in the range 0 through 100. Represent the set internally as a vector of bool values. Element a[i] is true if integer i is in the set. Element a[j] is false if integer j is not in the set. The default constructorinitializes a set to the so-called “empty set,” i.e., a set for which all elements contain false . Provide an intersectionOfSets member function which creates a third set which is the set-theoretic intersection of two existing sets (i.e., an element of the result is set to false if that element is false in either or both of the existing sets, and an element of the result is set to true if that element is true in each of the existing sets).
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…
1. Define a Matrix class to represent a square 2-D grid of int numbers. Include a constructor that takes one required int argument (for the number of rows and columns, which is the same since the matrix is square) and initializes all values to 0. Store the values in a self.data attribute. For example, Matrix(3) would initialize self.data as a list of lists of ints representing a 2-D grid with 3 rows and 3 columns. 2. Define a Matrix __str__(self) -> str method that would produce a string representation of a Matrix object. 3. Write a Matrix method set_value(self, i: int, j: int, val: int) that assigns val to the matrix value in the i-th row and j-th column of self.data. 4. Write a method get_diagonal(self) -> List[int] that returns the list of diagonal elements (from the top-left element to the bottom-right element). For example, if the matrix contains:
Suppose we have class named NumberList that holds a linked list of double values. In this section you will modify the class by adding recursive member functions. The functions will use recursion to traverse the linked list and perform the following operations: • Count the number of nodes in the list. To count the number of nodes in the list by recursion, we introduce two new member functions: numNodes and countNodes. countNodes is a private member function that uses recursion, and numNodes is the public interface that calls it. • Display the value of the list nodes in reverse order. To display the nodes in the list in reverse order, we introduce two new member functions: displayBackwards and showReverse. showReverse is a private member function that uses recursion, and displayBackwards is the public interface that calls it.
Programming Exercise 8 asks you to redefine the class to implement the nodes of a linked list so that the instance variables are private. Therefore, the class linkedListType and its derived classes unorderedLinkedList and orderedLinkedList can no longer directly access the instance variables of the class nodeType. Rewrite the definitions of these classes so that these classes use the member functions of the class nodeType to access the info and link fields of a node. Also write programs to test various operations of the classes unorderedLinkedList and orderedLinkedList. template <class Type>class nodeType{public:const nodeType<Type>& operator=(const nodeType<Type>&);//Overload the assignment operator.void setInfo(const Type& elem);//Function to set the info of the node.//Postcondition: info = elem;Type getInfo() const;//Function to return the info of the node.//Postcondition: The value of info is returned.void setLink(nodeType<Type>…
Create a template class List that contains a dynamic array of template type and an integer variable of size. Set the size of the array in the constructor. Include insert, show and Find Max and Find Min functions in the class. Find Max and Find Min functions return the maximum/minimum value stored in the array. Define all the functions outside the class. Test the class for at least two datatypes. In c++
Declare and implement 5 classes: FloatArray, SortedArray, FrontArray, PositiveArray & NegativeArray 1- The FloatArray class stores a dynamic array of floats and its size. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the array elements from the file (ifstream) and add them to the array.- A destructor to deallocate the array 2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add to the array then sort but rather add in the right place. 3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the front…