# data[].attributes.body
Queue using linked list is best way

# data[].attributes.body
Think: Priority queues can be used

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

Share:

# data[].attributes.body
Think : Queue implementation using linked list.

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.

# data[].attributes.body
Share: The best solution is using an array as queue.

# data[].attributes.body
Share: Best solution is a priority queue

# data[].attributes.body
Stackoverflow, as suggested by b043, b015, b013 can be an efficient approach to the given problem statement

# data[].attributes.body
Think:We use queues Pair: (Mookshit Jain B027) 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,Yug Desai B015,Abhinandan desai B013)

and shreyas dighe B017:priority queues and dictionary

# data[].attributes.body
Implementation: Assigning each seat in a Movie/Plane as a element in an array. This makes navigation easier compared to Link list. And dequeue/enqueue can not be used since when a person in the middle row cancels/adds his/her ticket doesn't mean all other elements are shifted a seat ahead. Since the order doesn't change with enqueue/dequeue, array is the best method for the given problem.

# data[].attributes.body
What if we used a hybrid of binary tree and linked list

# data[].attributes.body
Pair: Link list implementation using a queue should be used.

# data[].attributes.body
Think: Priority Queues

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

# data[].attributes.body
Seats are array elements.

# data[].attributes.body
Pair (Sanyuktha Kumbla B041): Priority queue is used to implement online booking since based on whoever offers the maximum price, gets more priority than the person who offers less price for the ticket.

# data[].attributes.body
ThinkQueue

# data[].attributes.body
Double Linked List helps in easy traversal. Also it minimises wastage of space. Finding the location of the data is easy too.

# data[].attributes.body
We use a priority queue

# data[].attributes.body
cerain no. Of seats which are to be cancelled can be filled using list. No spce will be wasted.

# data[].attributes.body
Each seat in a movie will be an array element. The element is filled when a seat is booked and is deleted when someone cancels a seat

# data[].attributes.body
Pair : A session can be created once a booking request is received via the application program. Once a session has been started, the reservation will be blocked/queued for the session's scope until the session is completed/terminated. A dictionary can be created which can store a key ( reference number provided to user ). This will ease out the process of searching a certain booking. Priority queue can be implemented with timestamps being logged for priority checks of the customers incase of concurrent access.

# data[].attributes.body
pair: Enqueue can be done based on the class,fare using priority queue and cancellation will be done using doubly linked list (del at specific position

# data[].attributes.body
Think: Priority queues (Based on time)

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.

# data[].attributes.body
Doubly linked list ftw

# data[].attributes.body
I think the answer should be priority queue as we assign certain priorities or conditions in order to book something for exp to book a room we may have priority list like fare , ratings etc and we sort it accordingly a priority queue can be implemented using linked list or an array

# data[].attributes.body
Think: Implementation of queue using linked list and priority queue based on time

# data[].attributes.body
Think: stack overflow

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).

# data[].attributes.body
Think: for online ticket booking we use queue and priority queue.

# data[].attributes.body
The concept of Doubly Linked List.

# data[].attributes.body
Each node containg details of person and serial no.

# data[].attributes.body
Think: priority queue

# data[].attributes.body
Think : priority queue

# data[].attributes.body
Priority queue is used

# data[].attributes.body
Think: I believe the method to do online booking is to use array as queue. Since we know the exact amount of seats available we don't need link list. Each element can be accessed quicker and easier compared to Link list.

# data[].attributes.body
Think : queue based implementation .... And a dictionary

# data[].attributes.body
Think:queues and stack overflow concept.

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

# data[].attributes.body
Priority queu

# data[].attributes.body
Think: For movie ticket bookings the base algorithm is Doubly Linked list in order to implement priority queue which decides who is booming the ticket first using FIFO rule. It also helps in keeping a track of multiple ticket bookings efficiently.

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.

# data[].attributes.body
Purvi Kotadiya B063 sem3

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

# data[].attributes.body
Priority Queue

# data[].attributes.body
Think: Queues based implementation and use of dictionary. Also stack overflow concept can be used for the booking with limited seats.

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.

# data[].attributes.body
Think: Queue using doubly linked lists

# data[].attributes.body
ThinkWe can use double link list.

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

# data[].attributes.body
Array or Linked list

# data[].attributes.body
Queue

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

# data[].attributes.body
Think : Queues using doubly linked list. Priority Queues can also be used to implement. First in First Out rule to ensure that first preference is given to the person booking first. It helps us manage multiple bookings efficiently. Thus, for booking tickets, movies, shows online we can use any of these methods.

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.

# data[].attributes.body
Think:Doubly linked list

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

# data[].attributes.body
graph and priority queue

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

# data[].attributes.body
Think:Priority Queue

Enqueue to book tickets and dequeue to delete

# data[].attributes.body
Think:Concept of Priority queues

# data[].attributes.headline
Pranav Kulkarni B039 concept of priority queues

# data[].attributes.subject
Pranav Kulkarni B039 concept of priority queues

# data[].attributes.body
Online booking procedures use priority queue.

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.

# data[].attributes.body
B033 B2 Sem 3 Think: We will use priority queue to implement booking system where priority is decided based on the class/fare of ticket. Enque can be used to book tickets and deque to cancel booking. Pair: We can cancel a booking by deleting the node in the doubly linked list. We can book new tickets by inserting nodes at the end of linked list.

# data[].attributes.body
Concept of priority queue is used in online ticket booking

# data[].attributes.body
1) Stack overflow

# data[].attributes.body
or booking movie tickets the main algorithm is doubly linked list to implement priority queue that decides who is booking the ticket first.  By using the FIFO rule. And it helps in keeping a track of multiple ticket bookings.

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

# data[].attributes.body
Think :Queues and stack overflow concept

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

# data[].attributes.body
Think : a dictionary along with a priority queue can be implemented

# data[].attributes.body
Think : priority queue

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

Share:

# data[].attributes.body
For booking online eg movies, either array or linked list is used to store the data as number of seats is limited and anyone sitting anywhere must be able to cancel their ticket, thus should be easy to delete it from anywhere.

# data[].attributes.body
Queues

# data[].attributes.body
Think: Queue using linked lists.

Pair: Seats can be used as array elements.

# data[].attributes.body
Think:We use queues

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)

# data[].attributes.body
Think: Priority Queue

# data[].attributes.body
Think: Priority queues (Based on time)

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.

# data[].attributes.body
We use a priority queue

# data[].attributes.body
We should Implement priority queues.

Pair:

Enqueue can be used to book tickets for the movie.

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

# data[].attributes.body
THINK: doubly linked list for online booking. The list grows and shrinks according to the number of bookings.

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

FEEDBACK: Implementation of queue using doubly linked list.

# data[].attributes.body
Stack overflow

# data[].attributes.body
Think: Online booking applications use Doubly Linked Lists and Priority Queues, an implementation of queues, for the procedure.

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.

# data[].attributes.body
Think: Queues can be used and stack overflow concept can be used to reserve tickets until they are completely booked. Also DBMS concepts can be used to prioritize booking

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

# data[].attributes.headline
Vasvi Desai B052 B3 BTech Comps Div B Sem 3

# data[].attributes.subject
Vasvi Desai B052 B3 BTech Comps Div B Sem 3

# data[].attributes.body
Think: We use linked list implementation of queue

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.

# data[].attributes.body
Think:Priority queues can be used for the online booking systems

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.

# data[].attributes.body
Stack over flow

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

# data[].attributes.body
Think : Queue implementation using linked list.

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.

# data[].attributes.body
Think:

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.

# data[].attributes.body
Think: Use a circular priority queue, based on time of booking. A circular queue will be more efficient than a normal queue. The queue should be implemented using arrays since there is a definite maximum limit of tickets that can be booked per show.

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.

# data[].attributes.body
Think: Online booking can be implemented using Priority queue

# data[].attributes.body
Think : Queues

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

# data[].attributes.body
Think : priority queue

# data[].attributes.body
Think: Queue and Priority Queue which use FIFO rule.

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

# data[].attributes.body
Priority queue can be used as a technique for implementation of online booking.

# data[].attributes.body
Marks: 5

Solution: 2

Pair and feedback: 1 Mark

Implementation : 1 Mark

Steps to implement: 1 Mark

# data[].attributes.body
Think: I can use data structure: Queue

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

# data[].attributes.body
Think(3Mins): Explain the techniques(ds) used in Booking Online (show/Movie/etc). Pair(4 mins): Discuss with friends Share(7 mins) : Discuss with class