Q108: Suppose a circular queue of capacity (n— 1) elements is... - Data Structures - Computer Application- ICAR JRF/SRF 2024 | Agrigyan

• Circular Queue Full and Empty Boundary Conditions:
• Consider a circular queue of capacity $n - 1$ implemented using an array of size $n$, with index pointers FRONT and REAR:
• One empty slot is reserved to distinguish between full and empty states.
• Empty Condition: When no elements reside in the queue:

• Full Condition: When inserting one more element would advance REAR to meet FRONT:

• Conclusion: Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT (Option 1).

Correct option: (1) Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT