Assignment 8
Assignment 8
Problem Definition: The ticket booking system of Cinemax theater has to be implemented using C++
program. There are 10 rows and 7 seats in each row. Doubly circular linked list has to be
maintained to keep track of free seats at rows. Assume some random booking to start with.
Use array to store pointers (Head pointer) to each row. On demand
a) The list of available seats is to be displayed
b) The seats are to be booked
c) The booking can be cancelled.
Objective:
• To perform Doubly Circular linked list for cinemax ticket booking.
• To display available seats.
• To book and cancel seats
Input:
Row no and seat no to book seat
Outcome:
• Display available seats to book movie ticket.
• Display status of Booked seat/ cancel seat.
Theory:
Circular Doubly Linked List is made up of two list the First one is doubly linked list and second one is
circular Linked List. Its last node points to the first node. Circular doubly linked list is bi directional in
nature. It means that the it can be transverse in both directions.
Conclusion: By this way, we can book or cancel movie ticket using doubly Circular linked lists.
Exercise:
1. What is Doubly Circular Linked List?
2. How to represent doubly circular linked list?
3. How to book or cancel seat?
3. What is doubly linked list?
4. How to insert and delete elements from doubly circulars linked list?