Scenario

$\text{'}$XYZ$\text{'}$ hotel chain has $100$ banquet halls island wide. Any hotel has minimum one banquet hall to

maximum $5$ halls. It provides online hotel banquet hall reservation facilities to their customers.

The reservation system uses a waiting list of the selected banquet halls.

Each banquet hall has unique id$,$ name, location, maximum number guests, reservation date and

the three menu prices. Customer can search a banquet hall with the location, reservation date

and the number of guests. According to the hotel chain rules and regulations, when a possible

match between reservation and the banquet hall is found the customer is contacted via email or

SMS and informed. If customer is not responding within a day, he or she is placed back in the

waiting list and must wait again for another hall.

If customer requested a date change or a location change or a change in number of guests, he or

she is placed back in the waiting list and must wait again for another reservation.

We will assume that each banquet hall, once accepted, will be occupied by a reservation ID$.$

Insert banquet hall details, reservation details and customer details through the keyboard.

The reservation process should remove a banquet hall on a given date from the queue if the

customer "accepts" the reservation. If the customer rejects or changes the reservation delete

the customer reservation, insert it to the back of the queue and compare next customer

reservation and repeat. This process repeats until all customers complete their reservations.Task $1$: Which data structure can be used, when simulating the above scenario. What are the valid operations that can be carried out on this data structure?

Task $2$: Implement the above scenario using the selected data structure and its valid operations for the design specification given in task $1.$ Use suitable error handling where appropriate. Test the application using suitable test cases and illustrate the system. Provide evidence of the test cases and the test results.

Task $3$: Determine the operations of a memory stack and how it is used to implement function calls related to the above scenario.

Task $4$: Sort the banquet hall list and display from the smallest to largest based on the maximum number of seating arrangements that can be done.

Sort the banquets halls with two different sorting algorithms and compare the performances of those two algorithms.

Task $5$: There are $8$ hotels available in the Southern district in Sri Lanka. A customer plans to visit all of these eight hotels through the shortest path within a day.

Analyse the operation, using illustrations, of two shortest path algorithms, showing how it

operates using a sample graph.

Task $6$: Banquet hall details are stored from oldest to newest hall. The customer should be able to find from the newest to the oldest banquet hall added to the hotel chain.

Using an imperative definition, specify the abstract data type for the above scenario.

Examine the advantages of encapsulation and information hiding when using an ADT selected for the above scenario.

Object orientation is a paradigm where a computer program functions by objects calling the methods of other objects, which ultimately produces program behaviour. It makes programming simple, readable, and makes programs maintainable. Imperative ADTs are basis for object orientation. Do you agree? Justify your answer.

Task $7$: Implement the above scenario using the selected complex ADT.

Demonstrate how the implementation of an ADT$/$algorithm solves the above problem.

Critically evaluate the complexity of an implemented ADT$/$algorithm$.$

Determine the different ways in which the efficiency of an algorithm can be measured, illustrating your answer the algorithm which you have developed.

Task $8$: Asymptotic analysis can be used to assess the effectiveness of an algorithm. How to use the Asymptotic analysis for the scenario given in task $7?$

What sort of trade$-$offs exists when you use a ADT for implementing programs? Describe the benefits of using independent data structures for implementing programs.