Question

In a circular queue implemented using an array of size n, with 'front' and 'rear' indices, which condition correctly indicates that the queue is completely full (assuming one slot is deliberately left empty to distinguish full from empty)?

A front == rear
B (rear + 1) % n == front
C (front + 1) % n == rear
D front == 0 and rear == 0
E rear == n - 1
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)