CS 14 - Program 1

Due Monday, April 22

Write a program for a phone company. You should use a list of lists. The main list will refer to the area code. The lists coming off the main list will store the telephone numbers in that area code. Each phone number should store the prefix and suffix separately. Example illustration shown below:

Your program should be able to support the following actions:

• Add a phone number to the list. Create a new area code node if necessary. For example, using the above list, adding the phone number 817-458-3101, would add a new node to the 817 area code list. Adding the phone number 350-921-6749 would add a new area code node of 350 and then off that list would add the phone number 921-6749. Be sure not to add duplicate numbers.
• Add phone numbers to the list from a user specified file. This adds to the current list being used. Duplicate numbers should not be added. The format of the file should be a phone number on each line in the following form 909-787-2604.
• Remove a phone number. If this would make the corresponding area code have an empty list, then you should also remove the area code node.
• Search for a given phone number.
• Count how many phone numbers there are in the list.
• Count how many phone numbers there are in a given area code.
• Split an area code. For example, move all the phone numbers with the 353 prefix in the 909 area code to a new area code of 650. The new area code should not already exist.
• Print out all the phone numbers nicely (showing area code, prefix, and suffix).
• Print out all the phone numbers within a given area code nicely.
• Print out all the area codes.
• Print out all the phone numbers with a given prefix nicely (showing area code, prefix, and suffix).

Level 1 Program (max points 150 out of 170)

Use an array for the main list of area codes. Use a linked list for each phone number list.

Level 2 Program

Use a linked lists for the main area code list, and use a linked list for each phone number list.

When you turn in your program electronically, be sure to turn in all your C++ files (.cc and .h) and a makefile. You must have your makefile name your executable either level1 or level2, based on which level of program you wrote. Programs will be graded under Linux. Significant points will be taken off if your program does not compile with a makefile.

Much of the grading of your program will be based on not just getting code to do the necessary functions correctly, but on your actual coding. Be sure to use good programming where possible (use of classes, functions, good parameter passing techniques, operator overloading, templates, error checking). Make your program user friendly.

There are many Lists templates available (for example, the Standard Template Library offers a list template class). However, for this assignment, when you use a linked list, it should be your own code so that you can practice your programming and learn the concepts thoroughly. On the next assignment, you will be required to use the STL list class. You may use any linked list variation of your choice.

You should have turned in what you have thus far on your program at least 6 hours before the due date (by 6pm). Then as you continue to work on your program, continue to turn in more current versions.