Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

c++ Your neighbor is an agent for a group of magicians. People call her to book magicians for holidays. She would like to use her

image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
c++
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.txt". The names are listed one per line, and have a maximum of 20 characters 2. The list of holidays is in text file "Holidays.txt". 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. 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.txt". 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 the 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 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, and 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 You should use both top-down and bottom-up testing. You need to execute the program more than one time. Save a copy of the output file ("Magic.txt") after each test run, as the program rewrites this file each time it is executed. Deliverables Program's source code. Copies of file "Magic.txt" from each of the final test executions. Implemented test plan and test drivers if appropriate. 4:35 Holidays.txt rider DaD a Independence Day Labor Day Columbus Day Veterans Day Thanksgiving Day Christmas Day Presidents Day New Years Day MLK Day Memorial Day 4:36 Magician.txt Dennis Kyriakos Dan Chan Dorian Rhodell Ryan Kane Alan Glen Michelette Mark Robinson Sebastian Boswell Gabriel Holmes Heather Rogers

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Deductive And Object Oriented Databases Second International Conference Dood 91 Munich Germany December 18 1991 Proceedings Lncs 566

Authors: Claude Delobel ,Michael Kifer ,Yoshifumi Masunaga

1st Edition

3540550151, 978-3540550150

More Books

Students also viewed these Databases questions

Question

2. How should this be dealt with by the organisation?

Answered: 1 week ago

Question

explain what is meant by the term fair dismissal

Answered: 1 week ago