Write a C program to Implementation of Linear Queue operations like enQueue(), deQueue() and displayQ() using Array
#include<stdio.h>
#include<stdlib.h>
#define MAX 10
int queue[MAX];
int rear = -1;
int front = -1;
void enQueue(int x) {
if(rear == MAX-1){
printf("QUEUE IS FULL");
return;
}
if(rear == -1 && front == -1){
front = rear = 0;
}
else
rear++;
queue[rear] = x;
}
int deQueue() {
int x;
if(front == -1 || front > rear) {
printf("QUEUE IS EMPTY");
return -1;
}
return queue[front++];
}
void displayQ() {
int i;
for(i=front; i<= rear; i++)
printf("%d ", queue[i]);
}
int main() {
int ch, p;
while(1){
printf("\n 1-> INSERT ");
printf("\n 2->DELETE ");
printf("\n 3->DISPLAY ");
printf("\n 4->EXIT ");
scanf("%d",&ch);
switch(ch){
case 1: printf("ENTER THE ELEMENT TO INSERT = ");
scanf("%d",&p);
enQueue(p);
break;
case 2: p = deQueue();
if((front == -1 || front > rear) && p==-1)
break;
else
printf("\nTHE DELETED ELEMENT IS %d",p);
break;
case 3: displayQ();
break;
case 4: exit(0);
}
}
}
OUTPUT :
Post a Comment
0 Comments