Program 7: Write a program to perform operations on Queue using array

implementation.

#include <stdio.h>
#include<stdlib.h>
#define size 5
int arr[size];
int front,rear;

void init()
{
front=rear=-1;
}

int isfull()
{
if(rear==size-1)
return 1;
else
return 0;
}

int isempty()
{
if(front==-1)
return 1;
else
return 0;
}

void enqueue(int x)
{
if(isfull())
{
printf("Queue is Overflow");
}
else
{
if(front==-1)
front=0;
rear=rear+1;
arr[rear]=x;
}
}

int dequeue()
{
if(isempty())
{
printf("Queue is underflow\n");
}
else
{
printf("The deleted element is %d",arr[front]);
printf("\nElement deleted successfully\n");
front++;
return arr[front];
}
}
void display()
{
int i;
if(isempty())
{
printf("Queue is empty\n");
}
else
{
printf("The queue is \n");
for(i=front;i<=rear;i++)
{
printf("%d\t",arr[i]);
}
}
}

int main()
{
init();
int ch,x;
while(1)
{
printf("\n1.Enqueue\n2.Dequeue\n3.Display\n4.Exit\n");
printf("Enter your choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1:
printf("Enter the value to be inserted\n");
scanf("%d",&x);
enqueue(x);
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
printf("Program terminated.....");
exit(0);
break;
default:
printf("Invalid choice\n");
break;
}
}
return 0;
}