C Program to illustrate Array Implementation of Queue

C Program to illustrate Array Implementation of Queue:

Main Program:

#include<stdio.h>
#include<conio.h>
#include"c:\tc\bin\subaiq.c"
void main()
{
int c,dat;
clrscr();
while(1)
{
printf("\nEnter your choice");
printf("\n1.Enqueue\n2.Dequeue \n3.Print enqueue\n4.Exit\n");
scanf("%d",&c);
switch(c)
{
case 1:printf("Enter the element to be inserted\n");
scanf("%d",&dat);
enqueue(dat);
printqueue();
break;
case 2:dequeue();
if(dat!=-1)
{
printf("The element deleted is %d\n",dat);
printqueue();
}
else
printf("Queue is Empty");
break;
case 3:printqueue();
break;
case 4:exit(0);

}
}
}

Sub Program: ( Saved as 'subaiq.c' )

#define size 100
int a[size];
int rear=-1;
int front=0;
void printqueue()
{
int j;
if(rear==-1)
printf("Queue is Empty");
else
{
printf("The element in the queue are\n");
for(j=0;j<=rear;j++)
printf("%d\t",a[j]);
}
}
void enqueue(int d)
{
if(rear==size-1)
printf("Queue is full");
else
{
rear++;
a[rear]=d;
}
}
int dequeue()
{
int d,i;
if(front>rear)
{
d=-1;
}
else
{
d=a[front];
for(i=front;i<=rear;i++)
a[i]=a[i+1];
rear=rear-1;
}
return d;
}