#include
#include
void main()
{
int i,li,ch,front=0,rear=0,val[100];
clrscr();
printf("Enter the capacity\n");
scanf("%d",&li);
while(1)
{
printf("\n\t\t\t Queue Operations\n");
printf("1. Insertion\n");
printf("2. Deletion\n");
printf("3. Display queue\n");
printf("4. Quit\n");
printf("Enter your choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1:
clrscr();
if(rear==li) printf("The Queue is full");
else
{
printf("Enter the value\n");
scanf("%d",&val[rear]);
rear++;
}
break;
case 2:
clrscr();
if(rear==front)
printf("The Queue is empty\n");
else
{
printf("\n The Deleted element is %d",val[front]);
for(i=1;i<=rear;i++)
val[i-1]=val[i];
rear--;
}
break;
case 3:
clrscr();
if(rear==front)
printf("There is no element in the Queue\n");
else
printf("The Elements are\n");
for(i=0;i<rear;i++)
printf("%d\t",val[i]);
break;
default:
exit(0);
}
}
}
No comments:
Post a Comment