Program to perform operation on a simple queue using C language.
#include<stdio.h>
int queue[100], choice, n, i, front=-1, rear=-1;
void main()
{
printf("Enter size of stack: ");
scanf("%d",&n);
do
{
printf("\n-----Simple Queue----\n1. INSERT\n2. REMOVE\n3. DISPLAY\n4. EXIT\n\n");
printf("Enter choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1: insert();
break;
case 2: remove1();
break;
case 3: display();
break;
case 4:
break;
default: printf("Enter valid choice.\n");
break;
}
}while(choice!=4);
}
void insert()
{
int value;
if(rear>=n-1)
{
printf("Queue is overflow.\n");
}
else
{
printf("Enter element to be inserted: ");
scanf("%d",&value);
rear=rear+1;
queue[rear] = value;
if(front==-1)
{
front=0;
}
printf("Element Inserted.\n");
}
}
void remove1()
{
if(front<=-1)
{
printf("Queue is underflow.\n");
}
else
{
printf("Element deleted is %d.\n",queue[front]);
if(front==rear){
front=-1;
rear=-1;
}
else{
front=front+1;
}
}
}
void display()
{
if(front==-1)
{
printf("Queue is underflow.\n");
}
else
{
for(i=front;i<=rear;i++)
{
printf("%d\n",queue[i]);
}
}
}
int queue[100], choice, n, i, front=-1, rear=-1;
void main()
{
printf("Enter size of stack: ");
scanf("%d",&n);
do
{
printf("\n-----Simple Queue----\n1. INSERT\n2. REMOVE\n3. DISPLAY\n4. EXIT\n\n");
printf("Enter choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1: insert();
break;
case 2: remove1();
break;
case 3: display();
break;
case 4:
break;
default: printf("Enter valid choice.\n");
break;
}
}while(choice!=4);
}
void insert()
{
int value;
if(rear>=n-1)
{
printf("Queue is overflow.\n");
}
else
{
printf("Enter element to be inserted: ");
scanf("%d",&value);
rear=rear+1;
queue[rear] = value;
if(front==-1)
{
front=0;
}
printf("Element Inserted.\n");
}
}
void remove1()
{
if(front<=-1)
{
printf("Queue is underflow.\n");
}
else
{
printf("Element deleted is %d.\n",queue[front]);
if(front==rear){
front=-1;
rear=-1;
}
else{
front=front+1;
}
}
}
void display()
{
if(front==-1)
{
printf("Queue is underflow.\n");
}
else
{
for(i=front;i<=rear;i++)
{
printf("%d\n",queue[i]);
}
}
}