Repository navigation
Expand file tree
/
Copy pathAssignment11.cpp
More file actions
110 lines (99 loc) · 1.98 KB
/
Copy pathAssignment11.cpp
File metadata and controls
110 lines (99 loc) · 1.98 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
#include<iostream>
using namespace std;
#define size 5
class PizzaQue
{
struct queue
{
int que[size];
int front, rear;
}Q;
public:
PizzaQue()
{
Q.front=-1;
Q.rear=-1;
}
int Qfull();
int Qempty();
int Accept(int);
int Ready();
void Display();
};
int PizzaQue::Qfull()
{
if(Q.front==(Q.rear+1)%size)
return 1;
else
return 0;
}
int PizzaQue::Qempty()
{
if(Q.front==-1)
return 1;
else
return 0;
}
int PizzaQue::Accept(int item)
{
if(Q.front==-1)
Q.front=Q.rear=0;
else
Q.rear=(Q.rear+1)%size;
Q.que[Q.rear]=item;
return Q.rear;
}
int PizzaQue::Ready()
{
cout<<"\n The order no : "<<Q.que[Q.front]<<" is Ready";
if(Q.front==Q.rear)
Q.front=Q.rear=-1;
else
Q.front=(Q.front+1)%size;
}
void PizzaQue:: Display()
{
int i;
i=Q.front;
while(i!=Q.rear)
{
cout<<" "<<Q.que[i];
i=(i+1)%size;
}
cout<<" "<<Q.que[i];
}
int main()
{
int choice,item;
PizzaQue obj;
do
{
cout<<"\n Main Menu";
cout<<"\n 1.ADD Order \n 2.Ready Order \n 3. Display Order Queue";
cout<<"\n Enter Your Choice";
cin>>choice;
switch(choice)
{
case 1: if(obj.Qfull())
cout<<"\n Can not accept order";
else
{
cout<<"\n Enter The order number: ";
cin>>item;
obj.Accept(item);
}
break;
case 2: if(obj.Qempty())
cout<<"\n No Order Ready";
else
obj.Ready();
break;
case 3: if(obj.Qempty())
cout<<"\n Order queue is empty";
else
obj.Display();
break;
default : cout<<"\n wrong choice";
}
}while(choice<=3);
}