Assignment 6

Linked lists

Due date: Day of the final exam

Points: 150

This is your last assignment and it will cover linked lists.

The problem: You have a phone book but you are not quite sure how many entries this telephone list will be. As we learned, an appropriate method would be to create a linked list using dynamic data with the names and phone numbers.

The program description will be similar to what you will find on page 1011 (programming problem #2) of our text book with the following modifications:

1. You will read 15 full names (last, first) with their phone numbers from a file on your floppy disk.

2. Once you open the file and load the names/phone numbers into a linked list, the user will interact with a menu like the one below:

Welcome to Bob's (your name) Address book

Choose one of the following :

Display all names and phone numbers sorted by Last name
Search for a name
Add a name and phone number
Delete a person from the list
Exit the phone book.

implement this telephone book using a dynamic linked list.

On option 1 - once you enter the a name, every time you choose option 1 it will display this list of users sorted by last name.

On option 2 - You can have the program just searching for a person by their last name. Look at some functions that may help you on strings.h on our compiler.

On option 3 - Make sure to identify to the user if the program has any limitations such as size of name, etc.

On options 4 - Make sure to show some feedback to the user stating that user "x" has been removed.

Keep the menu running constantly until user chooses to quit the program.

Submit

	A copy of your source code and data file.
	A floppy disk with your project file, source file, executable and data file.
	Place all in an envelope.

Back to CS162 Homepage
This page was last modified May 26, 2000
wmorales@pcc.edu