Question: Please do in C++, Classes to use: ------------------------------------- HOMEWORK #17-Virtual Functions for Unordered and Ordered Lists Write a program to create an unordered and ordered

Please do in C++,

Please do in C++, Classes to use: ------------------------------------- HOMEWORK #17-Virtual Functions for

Unordered and Ordered Lists Write a program to create an unordered and

ordered set of lists Specifications: 1. Copy the arrayListType class from Malik

Classes to use:

into an appropriate header and source file. 2. Copy the unorderedArrayListType class

from Malik into an appropriate header and source file Copy the orderedArraylistType

-------------------------------------

class from Malik into an appropriate header file. Complete the orderedArrayListType class

source file by writing the missing 3. 4. definitions of the appropriate

HOMEWORK #17-Virtual Functions for Unordered and Ordered Lists Write a program to create an unordered and ordered set of lists Specifications: 1. Copy the arrayListType class from Malik into an appropriate header and source file. 2. Copy the unorderedArrayListType class from Malik into an appropriate header and source file Copy the orderedArraylistType class from Malik into an appropriate header file. Complete the orderedArrayListType class source file by writing the missing 3. 4. definitions of the appropriate member functions. 5. The function remove () in the class arrayListType removes only the first occurrence of an element. Add the function removeAll () as an abstract function to the class arrayListType, which would remove all occurrences of a given element. Also write the definition of the function removeAll ) in the class unorderedArrayListType and orderedArrayListType 6. Add the member function min ) as an abstract function to arrayListType to return the smallest element of the list. Also write the definitions of the function min ) in the class unorderedArrayListType and orderedArrayListType. 7. Add the member function max () as an abstract function to arrayListType to return the largest element of the list. Also write the definitions of the function max ) in the class unorderedArrayListType and orderedArrayListType. 8. Write a program to test the full functionality of the unorderedArrayListType and orderedArrayListType classes HOMEWORK #17-Virtual Functions for Unordered and Ordered Lists Write a program to create an unordered and ordered set of lists Specifications: 1. Copy the arrayListType class from Malik into an appropriate header and source file. 2. Copy the unorderedArrayListType class from Malik into an appropriate header and source file Copy the orderedArraylistType class from Malik into an appropriate header file. Complete the orderedArrayListType class source file by writing the missing 3. 4. definitions of the appropriate member functions. 5. The function remove () in the class arrayListType removes only the first occurrence of an element. Add the function removeAll () as an abstract function to the class arrayListType, which would remove all occurrences of a given element. Also write the definition of the function removeAll ) in the class unorderedArrayListType and orderedArrayListType 6. Add the member function min ) as an abstract function to arrayListType to return the smallest element of the list. Also write the definitions of the function min ) in the class unorderedArrayListType and orderedArrayListType. 7. Add the member function max () as an abstract function to arrayListType to return the largest element of the list. Also write the definitions of the function max ) in the class unorderedArrayListType and orderedArrayListType. 8. Write a program to test the full functionality of the unorderedArrayListType and orderedArrayListType classes

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!