Design Due: 1 March.

Project Due: 24 March.

Administrative Information

Complete the following activities. You must work in pairs for the Project. You may not have more than 2 people on a team. If you cannot find a partner, I will appoint one.

All results must be put into the appropriate project folder on the cs174jb nova account.

All programs must have a heading identifying the people who worked on the project. Programs must also contain appropriate comments. See style sheets.

Your neighbor is an agent for a group of magicians. People call her to book magicians for holidays. She would like to use her new computer to keep track of the jobs she schedules for the magicians she manages, so she hires you to write the program.

Input

1. The list of magician names is in text file "Magician.dat". The names are listed one per line, and have a maximum of 20 characters.

2. The list of holidays is in text file "Holidays.dat". Again, the names are in listed one per line and have a maximum of 20 characters.

3. The current schedule (retained data from the previous executions of the program) is in file "Schedule". You determine the format of this file as part of your assignment.

4. The user (your neighbor the agent) inputs commands from the keyboard, in response from program prompts, as described under Command Processing below.

5. File "Schedule" must be rewritten to contain the updated magician schedule information.

Output

1. Prompts, menus, and responses to user commands are to be written to the screen, as described in the Processing instructions below.

2. A summary of each command's transaction must be written to a text file called "Magic.trn". You may determine the format of the information in this file; it should be labeled and formatted clearly.

3. File "Schedule" must be rewritten to contain the updated magician schedule information.

Command Processing

The program must process the commands described below. You may determine the details of the user interface; it must be relatively "friendly" and usable.

• SCHEDULE (customer) (holiday) Prompt the user for the name of the customer who wants to schedule a magician, and for the name of the holiday to be scheduled. Check to see if there is a magician free for this holiday. You should sequence through the magicians in the order in which you read them in. If a magician is available, book the magician; then print out the name of the magician, the holiday, and the name of the customer. If a magician is not available, put the customer on a waiting list, and print out a message indicating that the customer and holiday have been put on a waiting list.

• CANCEL (customer) (holiday) Prompt the user for the customer name and holiday. Delete the booking of a magician for t he listed holiday. Delete the reservation for that holiday. Update the schedule of the magician who was going to perform for the occasion. This may allow someone on the waiting list to be served. Sequence through the waiting list to see if someone wanted a booking on that holiday. If someone did want a magician on that holiday, schedule the booking and print a message. If this person is on the waiting list, delete the name from the waiting list.

• SIGNUP (magician) Prompt the user for the name of the new magician who is signing up with the agent.

• DROPOUT (magician) Prompt the user for the name of the magician who no longer needs the services of the agent. You must try to redistribute that magician's bookings to other magicians. If you reschedule a booking, print a message. If you can't, print out a message and add the request to the front of the waiting list.

• STATUS (magician or holiday) Prompt the user for the name of either a magician or holiday. Print out the appropriate schedule, appropriately formatted and labeled.

• QUIT Save the updated data to the files, then terminate the program.

  

  Data Structures

  You need lists for storing each of the following:

  1. A list of bookings for each holiday. (You may assume that there are at most ten holidays.) Each list is the schedule of one holiday. Each list element contains the name of the customer who made the booking and the name of the magician. Each list should be stored in alphabetical order, using the customer name as a key.
  2. A list of bookings for each magician. (You may assume that there are at most ten magicians.) Each list is the schedule of one magician. Each list element contains the name of the customer who made the booking and the holiday. Each list should be stored in alphabetical order, using the holiday name as a key.
  3. A waiting list. You need to be able to add to either end of the waiting list. You add to the front of the waiting list if you are rescheduling someone who had a booking, but lost it when a magician quit. You add to the back of the waiting list if someone requests an appointment and there are no free magicians.

  

  Testing

  This program is complicated. You must create a test plan and use test drivers (as is done in the labs). You need to execute the program more than one time. Make a hard copy of the output file ("Magic.trn") after each test run, as the program rewrites this file each time it is executed.

  

  Deliverables

  1. A design. You turn in an initial design on 25 February and you turn in a final design when you submit the project.

  2. Listing of the program's source code.

  3. Source code must be placed in the "project 1" folder on Nova.

  4. Hard copies of file "Magic.trn" from each of the final test executions.

  5. Implemented test plan and test drivers. Include both code and copies of your test plan.

  6. A 1-2 page paper describing how your program works, what objects are included in it, and what each person did on the project. Explain what advanced features are in the application and where you used advanced techniques.

  This project must be done in a group of two people. In no circumstance may more than 2 people work in a group. There are two parts to the project. Part 1 is the basic program. This is the "C" level project. Part 2 has advanced features that you can add. Your grade will depend on how many features you add and how well they are implemented.

  

  PART 1

  Requirements:

  1. You must turn in a design based on some decomposition design method. This design section is due on 25 February . It would be wise to complete the design before then.

  2. You must use a dynamic implementations of lists.

  3. You must use the String class developed in class to store any strings that you use.

  4. You do not have to implement the waiting list or associated functions. If there is no magician available for the holiday requested, print out an appropriate message.

  5. You do not have to save the schedule in a file. Every time you run this program, you will create a new schedule.

  6. You do not have to store lists in alphabetical order.

  7. You do not have to save a summary of transactions.

  8. Every function must have correct pre and post conditions.

  

  PART 2

  You must implement everything in part 1. The features discussed here are optional and provide a mechanism for improving your grade. You may choose to implement any number of options in any order. The exact grade you receive depends on the difficulty of your features as well as the effectiveness and correctness of your implementation.

  1. All programs beyond the "C" level must store lists in alphabetical order.

  2. All programs beyond the "C" level must implement the waiting list.

  3. Save a file of transactions.

  4. Implement a "save" command that the user can use to save the schedule.

  5. Implement a "load" command to allow the user to reload a schedule.

  6. Automatically save a file when the user uses the QUIT command.

  7. Allow a customer to specify a magician when they schedule an event. If their magician is not available, let them try another magician (provide a default magician that is available).

  8. Use a binary search when you need to sort a list.

  

  Grading

  Regardless of which parts you complete, your project will be graded based on its design and how well implemented it is. I will examine comments and programming style. A poorly designed and commented program, even with advanced features, will receive a poor grade.

  Your grade will be determined by the following criteria:

  1. Did you meet the minimum criteria for your level?

  2. How well commented is your code? How accurate are your pre/post conditions? How well formated is your program? Is your program easy to read?

  3. How complete is your test plan? Does it cover all of the code or input classes? Does your program pass all of the tests?

  4. How elegant is your user interface? Is it easy to use?

  5. How elegant is your design? Do you decompose the problem logically? Do you have redundant code? Does your class structure make sense?

  6. How well does your program run. Are there errors or inconsistencies?

  

  Hints

  1. Start your design by using top-down decomposition as we talked about in class. Determine what different parts there are in the problem. Then decompose these into smaller parts, etc.

  2. Implement and test your ADTs first. Create a test plan for your ADTs and driver code. Once you know that your ADTs work, then start on the rest of your project.
  

  Return to Student Pages

  Return to John Barr's Home Page

  Last Modified: 17 February 2000
  

  THIS PAGE MAINTAINED BY:
  John Barr, Ithaca College