$$$ QUEUE IMPLEMENTATION USING ARRAY $$$
PROGRAM:
#include<iostream>
#include<stdlib.h>
#define SIZE 5
using namespace std;
int q[SIZE],i,item,front=-1,rear=-1;
class queue
{
public:
void enqueue()
{
if(rear==SIZE-1)
{
cout<<"Queue
is full or overflow\n";
}
else
{
if(front==-1)
{
front=0;
}
cout<<"Enter
the element to be enqueued:\t";
cin>>item;
rear=rear+1;
q[rear]=item;
}
}
void dequeue()
{
if(front==-1
|| front>rear)
{
cout<<"Queue
is empty or underflow\n";
}
else
{
cout<<"The
deleted element is:"<<q[front]<<endl;
front=front+1;
}
}
void display()
{
if(front==-1
|| front>rear)
{
cout<<"Queue
is empty or underflow\n";
}
else
{
cout<<"Content
of the queue is:\n";
for(i=front;i<=rear;i++)
{
cout<<q[i]<<endl;
}
}
}
};
void main()
{
queue
q;
int ch;
cout<<"\n\n\n$$$
QUEUE IMPLEMENTATION USING ARRAY $$$\n\n\n";
while(1)
{
cout<<"QUEUE
OPERATIONS ARE\n";
cout<<"1.ENQUEUE\n2.DEQUEUE\n3.DISPLAY\n4.EXIT\n";
cout<<"Enter
your choice:\t";
cin>>ch;
switch(ch)
{
case
1:q.enqueue();break;
case
2:q.dequeue();break;
case
3:q.display();break;
case 4:exit(0);
default:cout<<"Enter
the correct option\n";
break;
}
}
}
OUTPUT:
$$$ QUEUE IMPLEMENTATION USING ARRAY $$$
QUEUE OPERATIONS ARE
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your choice:
1
Enter the element to be enqueued: 11
QUEUE OPERATIONS ARE
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your choice:
1
Enter the element to be enqueued: 22
QUEUE OPERATIONS ARE
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your choice:
1
Enter the element to be enqueued: 33
QUEUE OPERATIONS ARE
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your choice:
3
Content of the queue is:
11
22
33
QUEUE OPERATIONS ARE
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your choice:
2
The deleted element is: 11
QUEUE OPERATIONS ARE
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your choice:3
Content of the queue is:
22
33
QUEUE OPERATIONS ARE
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your choice:
4
No comments:
Post a Comment