PROGRAM:
OUTPUT:
QUEUE OPERATIONS ARE
#include<stdio.h>
#include<conio.h>
#define SIZE 5
void enqueue();
void dequeue();
void display();
int q[SIZE],i,item,front=-1,rear=-1;
void main()
{
int ch;
clrscr();
printf("\n\n\n$$$
QUEUE IMPLEMENTATION USING ARRAY $$$\n\n\n");
while(1)
{
printf("QUEUE
OPERATIONS ARE\n");
printf("1.ENQUEUE\n2.DEQUEUE\n3.DISPLAY\n4.EXIT\n");
printf("Enter
your choice:\t");
scanf("%d",&ch);
switch(ch)
{
case
1:enqueue();break;
case
2:dequeue();break;
case
3:display();break;
case
4:exit(0);
default:printf("Enter
the correct option\n");
break;
}
}
}
void enqueue()
{
if(rear==SIZE-1)
{
printf("Queue
is full or overflow\n");
}
else
{
if(front==-1)
{
front=0;
}
if(front==-1)
{
front=0;
}
printf("Enter
the element to be enqueued:\t");
scanf("%d",&item);
rear=rear+1;
q[rear]=item;
}
}
void dequeue()
{
if(front==-1 || front>rear)
{
printf("Queue
is empty or underflow\n");
}
else
{
printf("The
deleted element is: %d",q[front]);
front=front+1;
}
}
void display()
{
if(front==-1 || front>rear)
{
printf("Queue
is empty or underflow\n");
}
else
{
printf("Content
of the queue is:\n");
for(i=front;i<=rear;i++)
{
printf("%d\n",q[i]);
}
}
}
$$$ QUEUE IMPLEMENTATION USING ARRAY $$$
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