/* Write C++ programs to implement the Queue ADT using an array */
#include<iostream> #include<conio.h> #include<stdlib.h> using namespace std; class queue { int queue1[5]; int rear,front; public: queue() { rear=-1; front=-1; } void insert(int x) { if(rear > 4) { cout <<"queue over flow"; front=rear=-1; return; } queue1[++rear]=x; cout <<"inserted" <<x; } void delet() { if(front==rear) { cout <<"queue under flow"; return; } cout <<"deleted" <<queue1[++front]; } void display() { if(rear==front) { cout <<" queue empty"; return; } for(int i=front+1;i<=rear;i++) cout <<queue1[i]<<" "; } }; main() { int ch; queue qu; while(1) { cout <<"\n1.insert 2.delet 3.display 4.exit\nEnter ur choice"; cin >> ch; switch(ch) { case 1: cout <<"enter the element"; cin >> ch; qu.insert(ch); break; case 2: qu.delet(); break; case 3: qu.display();break; case 4: exit(0); } } return (0); } |
OUTPUT
1.insert 2.delet 3.display 4.exit
Enter ur choice1
enter the element21
inserted21
1.insert 2.delet 3.display 4.exit
Enter ur choice1
enter the element22
inserted22
1.insert 2.delet 3.display 4.exit
Enter ur choice1
enter the element16
inserted16
1.insert 2.delet 3.display 4.exit
Enter ur choice3
21 22 16
1.insert 2.delet 3.display 4.exit
Enter ur choice2
deleted21
1.insert 2.delet 3.display 4.exit
Enter ur choice3
22 16
1.insert 2.delet 3.display 4.exit
Enter ur choice
thnx
why is it for(int i=front+1;i<=rear;i++) and not for(int i=front;i<=rear;i++) before the main function?
its great .. thanks
yah….i am very glad about your solution for programs……
thanks alot.. please email me the limplemmentation of the linked list i’ll be very thankful to u …
great! but why u take -1 for front & rear?
really it is nice..thanks a lot
Thanks i get the main point but if it’s pble email me plz
thx for help. how about if i want to enter character? i already change it data type but also error.. please for help..
very nice,its usefull to me,thanks…………
nice…..
good but need with algorithm…………..
thanq……
😛
everything is awesome yay !!!!
its pretty helpful…..may God give u reward for this help ,,, 🙂
what is the use of while in this example or why use while(1) except while(2) or while(3) please answer !!
Great
nice
best
Its just a doubt but i think on this line
cout <<"deleted" <<queue1[++front];
++front will return the next value , not the value deleted
so ith should be
cout <<"deleted" <<queue1[front++];
(iostream) should actually have been (iostream.h)