Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Queue Circular Queue
Suppose a circular queue of capacity (n - 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variable respectively. Initially, REAR = FRONT = 0. The conditions to detect queue empty and queue full are
1
EMPTY : REAR == FRONT
FULL : (REAR + 1) mod n == FRONT
2
EMPTY : (FRONT + 1) mod n == REAR
FULL : (REAR + 1) mod n == FRONT
3
EMPTY (REAR + 1) mod n == FRONT
FULL : REAR == FRONT
4
EMPTY : REAR == FRONT
FULL : (FRONT + 1) mod n == REAR