Reference no: EM133774713

Simulation of Airline Reservation System

Focus on: Linked Lists, Dynamic Memory Allocation, and Object Oriented Programming

Task: Assume the Blue-Sky airlines use a linked list to maintain records for all passengers on its one and only flight.This list has a node for eachpassenger and passengers' records are maintained in the alphabetical order by passenger's last name.Each passenger node may contain the passenger first name, last name, address, passenger ID, reservation No, telephone number, seat number, and menu preference. Possible transactions may include but not limit to:

Function Name functionality
Main menu Show transaction choices
Make a Reservation Add a passenger to the list
Cancel a Reservation Delete a passenger from the list
Search for a Passenger Search for a special passenger by ID. If the passenger is found, then shows passenger's information otherwise prints "Not found".
Change Reservation seat change seat number.NOTE: No any seat numbers can be used more than once.
Changing Reservation food Change food
Print Passengers list Prints all passengers information
Produce reports Produces a food report and check-in report
Exit Quits the program

REQUIREMENTS:

1. You must use a single linear linked list to store your costumers' information.
2. You must develop a design document (pseudo code/data flow diagram)
3. Your program must produce a correct result if input is correct, otherwise an error message should be given.
4. You must comment your program properly (including proper comments and program synopsis), explain in comments why you wrote each line of your code the way you wrote it!
5. You must put your functions and variables together to form a class-reservation.
6. You need to have two classes: linked list and reservation.