#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define max 5
int q[max],front=-1,rear=-1;
void insert();
void Delete();
void display();
void main()
{
int ch;
clrscr();
printf("\n1.insert element to queue");
printf("\n2.Delete element to queue");
printf("\n3.display");
printf("\n4.exit");
while(1)
{
printf("\nEnter choice");
scanf("%d",&ch);
switch(ch)
{
case 1:insert();
break;
case 2:Delete();
break;
case 3:display();
break;
case 4:exit(0);
default:printf("wrong choice");
}
}
}
void insert()
{
int data;
if(rear==max-1)
printf("overflow");
else
{
if(front==-1)
{
front=0;
}
printf("\nEnter elements");
scanf("%d",&data);
rear++;
q[rear]=data;
}
}
void Delete()
{
if(front==-1||front>rear)
printf("\nunderflow");
else
{
printf("\nDelete:%d",q[front]);
front++;
}
}
void display()
{
int i;
if(front==-1)
printf("\nqueue is empty");
else
{
printf("\nElements");
for(i=front;i<=rear;i++)
{
printf("%d\n",q[i]);
}
}
}
Comments
Post a Comment