Enqueue for insertion of the booked tkt, dequeue for cancellation

Pair: We can implement priority queue based on dynamic fare with time.

Share: Discuss with class via online Padlet

Solution: 2

Pair and feedback: 1 Mark

Implementation : 1 Mark

Steps to implement: 1 Mark

Pair: Enqueue for booking tickets and dequeue for cancellation. Mrinali Gupta, Garima Arya and Purvi Kotadiya agree to this.

Pair: Priority queues can be used depending on the priority policy of the company.

Pair: 

Soham: A queue would be more efficient than a matrix.

Mohammed: Array implementation would be more efficient.

Share: A priority queue or a graph would be the best data structure to use.

Use a 2D array for the row and seat number. We can set it to show if the seat is occupied or not. To store the information and can reference the address of the element in the matrix. We also use array as we know the total number of seats do not change. Also traversing an array is easier.

Pair:

Prssanna:A circular queue will not be necessary as we don't need the timings the tickets are booked.

Mohammed :

An array would be easier to implement than a linked list and would require less space than a linked list.

Share:

I think my idea is the best.

Enque operation for every new booking.

Deque operation for every booking that's completed.

We set a limit to the number of nodes added for each linked list.

Then again, we define different head nodes for different flights, movie screens.

Latest reservation will be the last element of list [O(1)

For each resource, do a binary search on reservation list. [O(m*log(n) m-number of resource, n- size of reservation list 

Next element in list.

Feedback : concept always right :B

Pair: Vasvi Desai 

B052

concept of basic queue functions like enqueue dequeue etc

Steps: The priority queue data structure follows FIFO system

1.enqueue for booking the ticket

2.dequeue for cancelling

3.priority queue concept can be used to locate the highest priority element.

Share: prioroty queue concept is better.

Pair: (Pritha Patel - B056) The concepts of priority queue can also be implemented.

Queue ensures that we follow FIFO.

Enqueue function is used for booking the ticket.

Dequeue function can be used for cancelling the ticket.

We can also add the concept of priority queue to locate the highest priority element

Share: Priority queue.

Feedback: After discussion, Yug Desai agrees to my concept and according to him priority queues can also be used. We also understood that an ADT as data dictionary can be helpful. Karan Malhotra suggested that the classic method of transactional database.

Share: stack overflow is the best concept according to us ( B043 Karan Malhotra, B038 Yash Kothari, B015 Yug Desai , B017 Shreyas Dighe , B013 Abhinandan Desai,B011 Raunik Bokade

Pair: Arnav B012 agrees with the ideology.

Feedback: A graph should be used to see the number of users accessing. Also a stack overflow to check the maximum number of seats available. Array indexes should represent seats.

Implementation: A priority queue gives priority to the users who started the booking first and waits till the one before is either confirmed or cancelled. It is passed to a Doubly Linked List with each page of the booking procedure a node with an option to go back and forth to edit any details without having to do the whole procedure. When reaching the confirmation page, it is passed to a stack which has an overflow condition for the maximum number of seats.

Thus, multiple people can access the software at once, but the booking is prioritised for the person who enters the procedure first.

PAIR: Queue for online booking. Dequeue and enqueue for deleting and inserting the entries.

FEEDBACK: Implementation of queue using doubly linked list.

Pair:

Enqueue can be used to book tickets for the movie.

Doubly linked list can be used to delete the tickets at specific position.

Enqueue to book and dequeue to cancel the tickets.

Pair: You can use enqueue to book your tickets and to cancel we may use doubly linked list.

Pair: (Yash Kothari B038)

we can use priority queues and give higher priority to the person who starts the transaction first.

And use enqueue to reserve seats and dequeue to cancel the seats.

Share: best way to implement it is using stack overflow(Karan Malhotra B043 and Abhinandan Desai B013)

Pair: Seats can be used as array elements.

Pair: enqueue and dequeue can be used. Enqueue for Insertion of a new ticket and dequeue for cancellation of a ticket

Share:

Feedback :After discussion according to priyanshu queues and stack overflow concept can be used

enqueue and dequeue are used in order to record or store ticket bookings.

Feedback:

Varun Bhatia B005 agrees with my idea .

Implementation:

Priority queue is implemented to ensure the booking order for each user and and to ensure which booking comes first using the fifo rule in priority queue.

Enqueue to book tickets and dequeue to delete

Pair jaideep (B009,Sem III) and akash(b002.semIII: Jaideep agrees with the idea. Akash also agrees with my idea

SHARE: priority queue and graphs

Pair: Siddhant_B010 agress with me

Implementation: We can traverse back and forth and change seat bookings. Book my show follows the same logic.

Share: Graphs and priority queues

Pair : Enqueue is used to book tickets and and Dequeue is used for cancellation of bookings.

Priority Queue is implemented to ensure the bookings are done following FIFO rule so the person booking tickets first will be served first.

Feedback : I agree with the idea and believe that it can be used to implement efficiently. Stable usage of storage and less load on hardware, ensuring first come first serve rule. Thus, it's the most suitable method.

Feedback: After discussion with Parth Bhambhani, queues can be used

Nodes can be used to make each booking and in case of any changes

We can traverse back or front depending on what we want to change

Pair(Varun B005 B1 sem 3)- Varun agrees with my idea

But if there are multiple users accessing the same movie then its tedious to make more link list

Share: priority queue and graph would be the best method

Feedback: Concepts of priority queues, dictionary, stack overflow and the classis method of making a transactional database can provide optimum solution to the question according to Karan Malhotra and Abhinandan Desai

Best Solutuon: I think priority queues and stack overflow are the best solutions. Karan Malhotra and Abhinandan Desai and even Yash Kothari agree to this.

Implementation of queue using linked list and priority queue based on time...

Pair: Enqueue and Dequeue are used in order to record transactions /book tickets and for cancellations.

Priority Queue is implemented to ensure who makes the booking first gets those tickets.

Feedback: I agree with the idea of using priority queues to implement it as it is a very efficient method. It will ensure stable use of memory and first come first serve rule along with stable utilisation of the interface.

Feedback:after discussion according to raunik_b011 queues and stack overflow concept can be used

Share:stack overflow is the best concept(b011_raunik bokade b015 yug desai b017 shreyas dighe b013 abhinandan b018_ priyanshu nayak

Feedback: the classic method to do this is to use a transactional database and to do a tentative allocation of the seat to you that expires after some length of time along with stack overflows to determine if the tickets are available or not. Abhinandan says that priority queues can be used too.

Enqueue to book seats and de queue to cancel the reservation.

Best solution: The best solution imo is to use queues for reservation system(Mokshit Jain B027, Yash Kothari B038 and Abhinandan Desai B013,Yug Desai B015 suggested this).

Enqueue to book and dequeue to cancel the tickets.

Pair(B039): You can use enqueue to book your tickets and to cancel we may use doubly linked list.

Feedback: Yash Bhadra B066 too agrees that priority queues can be used..

and shreyas dighe B017:priority queues and dictionary

Implementation :

Enqueue operation for every new booking. Dequeue for every booking that's completed. We set a limit to the number of nodes added for each linked list. Then again, we define head nodes and limits for different flights, movie screens and stadiums. Pair: Prssanna: A circular queue should be unnecessary. Soham: Traversal over queue would be easier rather than that over a matrix. Share : A queue implementation using linked list will be the best.

Pair: Vasvi Desai B052, Pritha Patel B056 I agree we can used linked list also

Share: