NAME – YOGESH BALASAHEB KALEL

ROLL NO – 21

EXPERIMENT NO – 3
using To implement linear Queue ADT array :

#include <stdio.h>

#include<conio.h>

int Queue[20];

int F=-1;

int R=-1;

void insert(int);

void delete();

void display();

int num,n1,val,i;

int ch;

void main()

while(1)

printf("\n Enter your choice \n 1.To insert a number\n 2 .To delete a number \n 3.To
display all Queue element\n");

scanf("%d",&ch);

switch(ch)

case 1 : printf("enter a number \n ");

scanf("%d",&n1);

insert(n1);

break;
 case 2 :delete();

break;

case 3:display();

break;

default:printf("\n invalid input \n\n");

void insert(int num)

if(R==19)

printf("The queue is overflow \n");

else if (F==-1 && R==-1)

F=0;

R=0;

else{

R=R+1;

Queue[R]=num;

void delete()

{
 if(F==-1 || R<F)

printf("The queue is underflow");

}else

printf("deleted number is=%d",Queue[F]);

F=F+1;

void display()

for(i=F;i<=R;i++)

printf("%d \t",Queue[i]);