#include<stdio.h>

#include<conio.h>

int q[5],front=-1,rear=-1,max=5;

void print()

{

int i;

if(front==-1)

printf("QUEUE EMPTY");

else

{

if(front<=rear)

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

printf(" %d ",q[i]);

else

{

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

printf(" %d ",q[i]);

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

printf(" %d ",q[i]);

}

}

}

void insertrear()

{

if((front==rear+1)((front==0)&&(rear==max-1)))

printf("QUEUE IS FULL");

else

{

if(rear==max-1)

rear=0;

else

rear++;

if(front==-1)

front++;

printf("ENTER THE ELEMENT TO BE INSERTED :");

scanf("%d",&q[rear]);

printf("\ QUEUE AFTER INSERTION :");

print();

}

}

void delfront()

{

if(front==-1)

printf("QUEUE EMPTY");

else

{

printf("ELEMENT DELETED : %d",q[front]);

if(front==rear)

{

front=-1;

rear=-1;

}

else

if(front==max-1)

front=0;

else

front++;

printf("\ QUEUE AFTER DELETION :");

print();

}

}

void insertfront()

{

if((front==rear+1)((front==0)&&(rear==max-1)))

printf("QUEUE IS FULL");

else

{

if(front==-1)

{

front++;

rear++;

}

else

if(front==0)

front=max-1;

else

front--;

printf("ENTER THE ELEMENT TO BE INSERTED :");

scanf("%d",&q[front]);

printf("\ QUEUE AFTER INSERTION :");

print();

}

}

void delrear()

{

if(front==-1)

printf("QUEUE EMPTY");

else

{

printf("ELEMENT DELETED : %d",q[rear]);

if(front==rear)

{

front=-1;

rear=-1;

}

else

if(rear==0)

rear=max-1;

else

rear--;

printf("\ QUEUE AFTER DELETION :");

print();

}

}

void main()

{

int ch;

clrscr();

do

{

printf("\n1) INSERTION AT FRONT \n2)INSERTION AT

REAR\n3.DELETEION AT FRONT\n4.DELETION AT REAR\n ");

printf("\n ENTER CHOICE ");

scanf("%d",&ch);

switch(ch)

{

case 1:insertfront();

break;

case 2:insertrear();

break;

case 3:delfront();

break;

case 4:delrear();

break;

default :printf("WRONG CHOICE");

break;

}

}while(ch>=1&&ch<=4);

getch();

}

Resources

Top Categories

Product

Company