/**
Program Name: Circular Queue
Description: Circular Queue using Array
Author: Tauqirul Haque
*/
int front = -1; //This is the Initial Condition
int rear = -1;
#define SIZE 5
int queue[SIZE];
void deleteElement();
void insertElement();
void displayElement();
void main()
{
int ch;
while(ch !=4)
{
printf("\n\t\t1. Insert into queue..\n");
printf("\t\t2. Delete From Queue...\n");
printf("\t\t3. Diplay Queue...\n");
printf("\t\t4. Exit Program ...\n");
printf("Enter Your Choice # ");
scanf("%d",&ch);
switch(ch)
{
case 1:
insertElement();
break;
case 2:
deleteElement();
break;
case 3:
displayElement();
break;
case 4:
exit(0);
}
}
}
void insertElement()
{
int item;
printf("Enter The Item You want to Insert : ");
scanf("%d",&item);
if((front ==0 && rear == SIZE -1) || (front == rear + 1))
{
printf("\nQUEUE Overflow .. \n\n");
return;
}
if(front == -1)
{
front = rear = 0;
}
else
{
if(rear == SIZE - 1)
{
rear = 0;
}
else
{
rear++;
}
}
queue[rear] = item;
printf("\nRear = %d and Front = %d ", rear,front);
}
void deleteElement()
{
if(front==-1)
{
printf("\nUnderFlow ... \n");
return;
}
int item = queue[front];
if(front==rear)
{
front = -1;
rear = -1;
printf("The Item Deleted is : %d ",item );
return;
}
if(front == SIZE -1)
{
front = 0;
}
else
{
printf("The Item Deleted is : %d ",item );
front++;
}
printf("\nRear = %d and Front = %d ", rear,front);
}
void displayElement()
{
if(front == -1)
{
printf("\nThe Queue is Empty .. ");
return;
}
for(int i=front; i<=rear; i++)
{
printf("%4d", queue[i]);
}
}
Program Name: Circular Queue
Description: Circular Queue using Array
Author: Tauqirul Haque
*/
int front = -1; //This is the Initial Condition
int rear = -1;
#define SIZE 5
int queue[SIZE];
void deleteElement();
void insertElement();
void displayElement();
void main()
{
int ch;
while(ch !=4)
{
printf("\n\t\t1. Insert into queue..\n");
printf("\t\t2. Delete From Queue...\n");
printf("\t\t3. Diplay Queue...\n");
printf("\t\t4. Exit Program ...\n");
printf("Enter Your Choice # ");
scanf("%d",&ch);
switch(ch)
{
case 1:
insertElement();
break;
case 2:
deleteElement();
break;
case 3:
displayElement();
break;
case 4:
exit(0);
}
}
}
void insertElement()
{
int item;
printf("Enter The Item You want to Insert : ");
scanf("%d",&item);
if((front ==0 && rear == SIZE -1) || (front == rear + 1))
{
printf("\nQUEUE Overflow .. \n\n");
return;
}
if(front == -1)
{
front = rear = 0;
}
else
{
if(rear == SIZE - 1)
{
rear = 0;
}
else
{
rear++;
}
}
queue[rear] = item;
printf("\nRear = %d and Front = %d ", rear,front);
}
void deleteElement()
{
if(front==-1)
{
printf("\nUnderFlow ... \n");
return;
}
int item = queue[front];
if(front==rear)
{
front = -1;
rear = -1;
printf("The Item Deleted is : %d ",item );
return;
}
if(front == SIZE -1)
{
front = 0;
}
else
{
printf("The Item Deleted is : %d ",item );
front++;
}
printf("\nRear = %d and Front = %d ", rear,front);
}
void displayElement()
{
if(front == -1)
{
printf("\nThe Queue is Empty .. ");
return;
}
for(int i=front; i<=rear; i++)
{
printf("%4d", queue[i]);
}
}
Comments