Pointers and Linked Lists
Reading: Complete the reading required for Part D of the Syllabus.
Programming: An individual assignment.
Part A:
Do the following Exercises at the end of Chapter 7 of the H & R text
Do the following Exercises at the end of Chapter 8 of the H & R text
Part B:
Write the program requested in Programming Project 8.4 of the H & R text. For the first part of the requested Output (first paragraph of the section entitled OUTPUT, You are expected to maintain the list of attendees as a singly linked list (named SLL for the purposes of this discussion), ordered by last name of attendee. Test your program using the data stored on the CIS 083 "board" under file Asgn5.dat.
The output requested in the second paragraph of the OUTPUT section is more difficult to achieve. You should be reasonably clever in choosing an approach to generating the required state-by-state listing. (Note that this listing does not have to be ordered in anyway -- just grouped by state).
We want all parts of your program to run reasonably efficiently. Be sure to provide an English description (no more than one page double-spaced) outlining the approach you used in generating the state list.
Turn In: To be decided.