Posts

GROUP E : 32 Pizza parlor accepting maximum M orders. Orders are served in first come first served basis. Order once placed can not be cancelled. Write C++ program to simulate the system using circular queue using array.

  Assignment GPE32   /* Pizza parlor accepting maximum M orders. Orders are served in first come first served basis. Order once placed can not be cancelled. Write C++ program to simulate the system using circular queue using array. */ Link : https://www.youtube.com/watch?v=ArVoZ1KrHDY Animated link : https://www.youtube.com/watch?v=-GxuQ-Y8sbA   =========================================================================== # include <iostream>   usingnamespace std ; Const int MAX= 5 ; Class PizzaParlour {       int front,rear;       int orders[MAX];       public:               PizzaParlour ()              ...

GROUP C : 20. 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

#include <iostream> using namespace std;   struct node {       int seatc , seatr ;       string status ;       struct node * next ,* prev ; }*head[10],*last[10];   class ticket { public :       ticket ()       {             for ( int i=1 ; i<=10 ; i++)             {                   head[i]=last[i]=NULL;                   struct node * temp;                   for ( int j=1 ; j<=7 ; j++)         ...