#include<stdio.

h>

#include<stdlib.h>

#include<conio.h>

#define MAX 100

int queue [MAX];

int rear = -1;

int front = -1;

void insert(int item);

int del();

int peek();

void display();

int is_Full();

int is_Empty();

void main()

{int choice, n;

clrscr();

printf("purva pravin jage 43ECSB")

while(1)

{printf(" ***********Main Menu***********\n");

printf(" 1. Insert\n 2. Delete \n 3. Display Front Element \n 4. Display All Element \n 5. Quit ");

printf("\n Enter your Choice:");

scanf("%d"

, &choice);

switch(choice)

{case 1:

printf("Input the element:");

scanf("%d"

, &n);

insert(n);
break;

case 2:

n = del();

printf("Deleted Element is %d\n"

, n);

break;

case 3:

printf("Element at the front is %d\n"

, peek());

break;

case 4:

display();

break;

case 5:

exit(1);

default:

printf("Wrong Option");

getch();

void insert(int n)

{if(is_Full())

{printf("Queue Overflow\n");

return;

else if(front == -1)

{front = 0;

}
queue[++rear] = n;

int del()

{int n;

if(is_Empty())

{printf("Queue Underflow\n");

exit(1);

n = queue[front++];

return n;

int peek()

{if(is_Empty())

{printf("Queue Underflow\n");

return queue[front];

int is_Empty()

{if(front == -1||front == rear+1)

return 1;

else

return 0;

int is_Full()

{if(rear == MAX-1)

return 1;

else

return 0;

}
void display()

{int i;

if(is_Empty())

{printf("Queue is Empty\n");

return;

printf("Queue is:");

for(i = front; i<=rear; i++)

{printf("%d"

, queue[i]);

printf("\n");

Output :