Scribd
Upload
23 views

Implementation of Queue Using Array

The document describes how to implement a queue data structure using an array in C. It defines functions for enqueue, dequeue, display and get front element. It uses global variables to track the front and rear indexes of the queue in the array.

Uploaded by

Agni Chakraborty
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

Implementation of Queue Using Array

The document describes how to implement a queue data structure using an array in C. It defines functions for enqueue, dequeue, display and get front element. It uses global variables to track the front and rear indexes of the queue in the array.

Uploaded by

Agni Chakraborty
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Implementation of Queue using Array

//Implementation of Queue using Array

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define SIZE 10

void enQueue(int);
void deQueue();
void display();
void frontElement();

int queue[SIZE], front = -1, rear = -1;

void main()
{
int value, choice;
clrscr();
while(1){
printf("\n\n***** MENU *****\n");
printf("1. Insertion\n2. Deletion\n3. Display\n4. Front_element\n5. Exit");
printf("\nEnter your choice: ");
scanf("%d",&choice);
switch(choice){
case 1: printf("Enter the value to be insert: ");
scanf("%d",&value);
enQueue(value);
break;
case 2: deQueue();
break;
case 3: display();
break;
case 4: frontElement();
break;
case 5: exit(0);
default: printf("\nWrong selection!!! Try again!!!");
}
}
}
void enQueue(int value){
if(rear == SIZE-1)
printf("\nQueue is Full!!! Insertion is not possible!!!");
else{
if(front == -1)
front = 0;
rear++;
queue[rear] = value;
printf("\nInsertion success!!!");
}
}
void deQueue(){
if(front ==-1||front>rear)
printf("\nQueue is Empty!!! Deletion is not possible!!!");

printf("\nDeleted : %d", queue[front]);

if(front==rear)
front = rear = -1;
else
front++;

}
void display(){
if(rear == -1)
printf("\nQueue is Empty!!!");
else{
int i;
printf("\nQueue elements are:\n");
for(i=front; i<=rear; i++)
printf("%d\t",queue[i]);
}
}
void frontElement()
{
if(front==-1)
{
printf("\nQueue is empty!!!");
getch();
return;
}
printf("\nThe front element is %d",queue[front]);

You might also like