Scribd
Upload
4 views9 pages

Queue Using Arrays

A queue is a linear data structure that follows the FIFO principle, with insertion at the REAR and deletion at the FRONT. Key operations include enQueue() for insertion, deQueue() for deletion, and display() for showing elements, with conditions for overflow and underflow. Implementation can be done using arrays or linked lists, with specific steps outlined for creating and managing a queue using an array.

Uploaded by

ashokboya841
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views9 pages

Queue Using Arrays

A queue is a linear data structure that follows the FIFO principle, with insertion at the REAR and deletion at the FRONT. Key operations include enQueue() for insertion, deQueue() for deletion, and display() for showing elements, with conditions for overflow and underflow. Implementation can be done using arrays or linked lists, with specific steps outlined for creating and managing a queue using an array.

Uploaded by

ashokboya841
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Queue

What is a Queue?
Queue is a linear data structure in which the insertion and deletion operations are performed at
two different ends The insertion is performed at one end called REAR and deletion is performed
at another end called FRONT. In queue data structure, the insertion and deletion operations are
performed based on FIFO (First In First Out) principle.

Initially FRONT=REAR=-1 for empty Queue

In a queue data structure, the insertion operation is performed using a function called
"enQueue()" and deletion operation is performed using a function called "deQueue()".

 To say Queue is empty Both FRONT=REAR=-1


 For the first element insertion both FRONT and REAR are incremented to 0 from -1
 From the second element on wards
For Insertion: REAR++;
q[REAR]=ele;
For Deletion: ele=q[front];
Front++;
Operations on a Queue
The following operations are performed on
a queue data structure...
1. Creation of Queue (int queue[5])
2. enQueue(value) - (To insert an
element into the queue)
3. deQueue() - (To delete an
element from the queue)
4. display() - (To display the
elements of the queue)
Conditions of Queue: 2 conditions to
1.Queue Overflow:Trying to insert an element
in to the queue when it is full.
2.Queue Underflow: Trying to delete an
element from the queue when it is empty.

Implementation of a Queue

Queue data structure can be implemented in two ways. They are as follows...

1. Using Array
2. Using Linked List

Queue Implementation Using


Array

 A queue data structure can be implemented using one dimensional array.


 The queue implemented using array stores only fixed number of data values.
 Initially both 'front' and 'rear' are set to -1.
 Whenever, we want to insert a new value into the queue, increment 'rear' value by one
and then insert at that position.
 Whenever we want to delete a value from the queue, then delete the element which is at
'front' position and increment 'front' value by one

Queue Operations using Array


Queue data structure using array can be implemented as follows...

Before we implement actual operations, first follow the below steps to create an empty queue.

 Step 1 - Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
 Step 2 - Declare all the user defined functions which are used in queue
implementation.
 Step 3 - Create a one dimensional array with above defined SIZE (int queue[SIZE])
 Step 4 - Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int
front = -1, rear = -1)
 Step 5 - Then implement main method by displaying menu of operations list and make
suitable function calls to perform operation selected by the user on queue.

enQueue(value) - Inserting value into the queue


In a queue data structure, enQueue() is a function used to insert a new element into the queue.
In a queue, the new element is always inserted at rear position. The enQueue() function takes
one integer value as a parameter and inserts that value into the queue. We can use the following
steps to insert an element into the queue...

 Step 1 - Check whether queue is FULL. (rear == SIZE-1)


 Step 2 - If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and
terminate the function.
 Step 3 - If it is NOT FULL, then increment rear value by one (rear++) and
set queue[rear] = value.
deQueue() - Deleting a value from the Queue
In a queue data structure, deQueue() is a function used to delete an element from the queue. In
a queue, the element is always deleted from front position. The deQueue() function does not
take any value as parameter. We can use the following steps to delete an element from the
queue...

 Step 1 - Check whether queue is EMPTY. (front == -1 or front>rear)


 Step 2 - If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not
possible!!!" and terminate the function.
 Step 3 - If it is NOT EMPTY, Then display queue[front] as deleted element and then
increment the front value by one (front ++)..


display() - Displays the elements of a Queue
We can use the following steps to display the elements of a queue...

 Step 1 - Check whether queue is EMPTY. (front == -1 or front>rear)


 Step 2 - If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
 Step 3 - If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front'.
 Step 4 - Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same
until 'i' value reaches to rear (i <= rear)

/*Queue using Arrays*/

#include<stdio.h>

#include<stdlib.h>

#define SIZE 5

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

void enque(int);

void deque();

void display();

int main()

int choice,ele;

char op;

do

printf("Menu");

printf("\n 1.Enque");

printf("\n 2.Deque");

printf("\n 3.DISPLAY");

printf("/n Enter choice ");

scanf("%d",&choice);

switch(choice)

{
case 1:

printf("\nEnter element to Insert/Enque");

scanf("%d",&ele);

enque(ele);

break;

case 2:deque();break;

case 3:display();break;

default:

printf("\nInvalid choice");

printf("\ndo u want to continue Y/N");

fflush(stdin);

scanf(" %c",&op);

}while(op=='y'||op=='Y');

return 0;

void enque(int ele)

if(rear==SIZE-1)

printf("q is full,cant insert");

else if(rear==-1)

rear++;
front++;

q[rear]=ele;

printf("\nfirst Element inserted successfully");

else

rear++;

q[rear]=ele;

printf("\nElement inserted successfully");

void deque()

if(front==-1 || front==rear+1)

printf("\n Q empty,cant delete");

else

printf("\n deleted elemt is %d",q[front]);

front++;

void display()

int i;

if(front==-1 || front==rear+1)
{

printf("\n Q empty,cant display");

else

printf("\n Q elements are");

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

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

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy