//Example: Program to implement a queue using Array
#include<stdio.h>
#define MAX 50
int queue_array[MAX];
void inserts();
void delet();
void display();
void exit();
int rear=-1;
int front=-1;
int main(){
int choice;
while(1)
{
printf(“1.Insert\n”);
printf(“2.Delete\n”);
printf(“3.Display\n”);
printf(“4.Exit\n”);
printf(“Enter your choice:”);
scanf(“%d”,&choice);
switch(choice) {
case 1: inserts(); break;
case 2: delet(); break;
case 3: display(); break;
case 4: exit(); break;
}/* End of switch */
}/*End of while*/
return 0;
}/* End of main()*/
void inserts(){
int add_item;
if(rear==MAX-1) /*Queue is Full*/
printf(“Queue Overflow\n”);
else
{
if(front==-1)/*Initially queue is empty */
front=front+1;
printf(“Insert the element in queue :”);
scanf(“%d”,&add_item);
rear=rear+1; /* For normal operation */
queue_array[rear]=add_item;
}
}/*End of insert()*/
void delet(){
if(front==-1)
printf(“Queue Underflow”);
else
{
printf(“Deleted Element is : %d\n”,queue_array[front]);
front=front+1;
}
}/*End of delete()*/
void display(){
int i;
if(front==-1)
printf(“Queue is empty\n”);
else
{
printf(“Queue is : \n”);
for(i=front;i<=rear;i++)
printf(“%d”,queue_array[i]);
printf(“\n”);
}
}/*End of display()*/
void exit()
{
return;
}
