Project1: Build and process a sorted linked list. Rewrite the first homework assignment(attached below) according to the following specifications.
A. Reads data from a text file (mountains.txt) and inserts them into a
circularly sorted doubly-linked list with a sentinel node. The list is to be sorted in
ascending order by the mountain name named name (a unique key). The
Mountain class has four data members:
name (string)
elevation (int)
range(string)
state (string)
B. Prints the list as a table with four columns (header included) in ascending
order.
C. Prints the list as a table with four columns (header included) in descending
order.
D. Prints the number of items in the list.
E. Searches the list: prompts the user to enter the name of the mountain or QUIT
to stop searching; searches for that name: if found, displays its’ data, otherwise
displays some message, such as “… Not found”
F. Deletes nodes from the list: prompts the user to enter the name of the mountain
to be deleted from the list or QUIT to stop deleting.
G. Prints the number of items in the list.
H. Prints the list as a table with four columns (header included)
I. Prints the list as a table with four columns (header included) in descending
order.
J. Destroys the list //no memory leak
Project1+: Rewrite Project1 as an ADT (templates)
1. Download the PDF file and zip files.
2. Check the PDF files very carefully.
3. You can refer all the sources in the zipped files.
4. You must meet the requirements listed in the PDF files.
5. Submit within the given time.
0 comments