Practical No: -13
Experiment No. 13: Pizza parlor accepting maximum M orders. Orders are served in first come first
served basis. Order once placed cannot be cancelled. Write C++ program to simulate the system using
circular queue using array.
Code:
#include<iostream>
using namespace std;
#define SIZE 3
int Queue[SIZE];
int front=-1;
int rear=-1;
int isEmpty()
{
if(front==rear+1)
{ cout<<"\n Queue Empty:" ;
return(1);
}
return(0);
}
int Qfull()
{
if((rear+1) % SIZE==front)
{ cout<<"\n Queue Full:\n" ;
return(1);
}
return(0);
}
void enque(int data)
{
if(!Qfull())
{
if(front==-1)
front=0;
rear++;
Queue[rear]=data;
cout<<"\n Inserted :"<<data<<"\n";
return;
}
cout<<"\n Cannot insert:"<<data<<"\n";
}
int deque()
{
if(!isEmpty())
{
int t=Queue[front];
front++;
cout<<"\n Front:"<<front<<"\n";
return(t);
}
}
int main()
{
enque(10);
enque(20);
enque(30);
enque(40);
cout<<deque()<<"\n";
enque(40);
cout<<deque()<<"\n";
cout<<deque()<<"\n";
cout<<deque()<<"\n";
cout<<deque()<<"\n";
return(0);
}
Output:
Inserted :10
Inserted :20
Inserted :30
Queue Full:
Cannot insert:40
Front:1
10
Inserted :40
Front:2
20
Front:3
30
Front:4
40
Queue Empty:0
