data-structures/queue.cpp at main · Yash14909/data-structures · GitHub

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
111
112
113
114
115
116
117
118
119
120
121
122
/*Program 9
Write a program in CPP to implements Queue using Array.
Run the code in Turbo C++*/

#include<iostream.h>
#include<conio.h>
#include<ctype.h>
#include<stdlib.h>
#define mx 20
int q[mx];
int r = -1, f=-1;

/* prototypes */
int qfull(void);
int qempty(void);
void addq(void);
void delq(void);
void displayq(void);

main()
{
char resp;
int ch;
do
{
clrscr();
cout<<" MENU\n";
cout<<"1. ADD\n";
cout<<"2, Delete\n";
cout<<"3. Display\n";
cout<<"4. Exit\n";
cout<<"Enter the choice\n";
cin>>ch;
switch(ch)
{
case 1 : addq(); break;

case 2 : delq(); break;

case 3 : displayq(); break;

case 4: exit(1);

default :
cout<<"Invalid Choice... 1..4";
}
cout<<"Any more trials(y/n) ";
resp=getche();
}
  while(toupper(resp)=='Y');
}

int qfull(void)
{
if(r==mx-1)
return(1);
else return(0);
}

int qempty(void)
{
if(r==-1 && f==-1)
return(1);
else
return(0);
}

void addq(void)
{
char resp; do
{
if(qfull()==1)
{
cout<<"Queue is full";
getch();
}
else
{
cout<<"\nEnter the element :"; cin>>q[++r];
/* sp case*/

if(f==-1) f=0;
}
cout<<"\n Do you want to add any more elements(y/n)"; resp=getche();

}while(toupper(resp)=='Y');
}

void delq(void)
{
char resp; do
{
if(qempty()==1)
{
cout<<"Queue is empty";
getch();
}
else
{
cout<<"deleted element is : "<<q[f++];
getch();
}
cout<<"Any more deletions(y/n)";
resp=getche();
}
  while(toupper(resp)=='Y');
}

void displayq(void)
{
int i;
if(qempty()==1)
cout<<"Queue is empty";
else
{
cout<<"Queue is \n";
for(i = f;i<=r;i++)
cout<<"\t"<<q[i];
}
getch();
}