Scribd
Upload
43 views

Circular Queue

A circular queue overcomes the limitation of a normal queue by connecting the last position to the first position, allowing elements to be inserted even when the queue is full. It implements the FIFO principle. To create a circular queue, an array is used with front and rear pointers to track the first and last positions. Elements can be inserted at the rear and removed from the front, looping back to the front of the array when necessary. Common operations like enqueue, dequeue and display are implemented using steps that check for empty/full conditions and update the front and rear pointers accordingly.

Uploaded by

PUB-G DREAMING
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
43 views

Circular Queue

A circular queue overcomes the limitation of a normal queue by connecting the last position to the first position, allowing elements to be inserted even when the queue is full. It implements the FIFO principle. To create a circular queue, an array is used with front and rear pointers to track the first and last positions. Elements can be inserted at the rear and removed from the front, looping back to the front of the array when necessary. Common operations like enqueue, dequeue and display are implemented using steps that check for empty/full conditions and update the front and rear pointers accordingly.

Uploaded by

PUB-G DREAMING
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

CIRCULAR QUEUE

CIRCULAR QUEUE DATASTRUCTURE

 In a normal Queue Data Structure, we can insert


elements until queue becomes full. But once the queue
becomes full, we can not insert the next element until all
the elements are deleted from the queue.

 For example, consider


the queue after inserting all the elements into it is as
follows...
In the above situation, even though we have empty positions in the queue we
can not make use of them to insert the new element. This is the major problem
in a normal queue data structure. To overcome this problem we use a circular
queue data structure.
WHAT IS CIRCULAR QUEUE?

 A Circular Queue can be defined as follows...

A circular queue is a linear data structure in


which the operations are performed based on FIFO (First
In First Out) principle and the last position is connected
back to the first position to make a circle.
GRAPHICAL REPRESENTATION OF A CIRCULAR
QUEUE IS AS FOLLOWS...
IMPLEMENTATION OF CIRCULAR QUEUE

 To implement a circular queue data structure using an array,


we first perform the following steps before we implement
actual operations.

 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 user defined functions used in circular
queue implementation.
 Step 3 - Create a one dimensional array with above defined
SIZE (int cQueue[SIZE])
 Step 4 - Define two integer variables 'front' and 'rear' and
initialize both with '-1'. (int front = -1, rear = -1)
 Step 5 - Implement main method by displaying menu of
operations list and make suitable function calls to perform
operation selected by the user on circular queue.
ENQUEUE(VALUE) - INSERTING VALUE INTO THE
CIRCULAR QUEUE

 In a circular queue, enQueue() is a function which is used to


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

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


&& front == 0) || (front == rear+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 check rear == SIZE - 1
&& front != 0 if it is TRUE, then set rear = -1.
 Step 4 - Increment rear value by one (rear++),
set queue[rear] = value and check 'front == -1' if it
is TRUE, then set front = 0.
DEQUEUE() - DELETING A VALUE FROM THE
CIRCULAR QUEUE

 In a circular queue, deQueue() is a function used to delete an


element from the circular queue. In a circular queue, the
element is always deleted from front position. The deQueue()
function doesn't take any value as a parameter. We can use the
following steps to delete an element from the circular queue...

 Step 1 - Check whether queue is EMPTY. (front == -1 &&


rear == -1)
 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 increment the front value by one (front
++). Then check whether front == SIZE, if it is TRUE, then
set front = 0. Then check whether both front - 1 and rear are
equal (front -1 == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY() - DISPLAYS THE ELEMENTS OF A
CIRCULAR QUEUE

 We can use the following steps to display the elements of a circular


queue...

 Step 1 - Check whether queue is EMPTY. (front == -1)


 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 - Check whether 'front <= rear', if it is TRUE, then display
'queue[i]' value and increment 'i' value by one (i++). Repeat the
same until 'i <= rear' becomes FALSE.
 Step 5 - If 'front <= rear' is FALSE, then display 'queue[i]' value
and increment 'i' value by one (i++). Repeat the same until'i <=
SIZE - 1' becomes FALSE.
 Step 6 - Set i to 0.
 Step 7 - Again display 'cQueue[i]' value and increment i value by
one (i++). Repeat the same until 'i <= rear' becomes FALSE.
Thank You

You might also like