Circular queueFIFO · front & rear wrap around
FR0
1
2
3
4
5
6
7
Front (next out)
—
Rear (last in)
—
Count
0/ 8
rear = (rear + 1) % 8 · front = (front + 1) % 8 — classic array circular queue.
Queue Behaviour Sandbox
CSC-211 · Semester III · Data Structures and Algorithms
Front (next out)
—
Rear (last in)
—
Count
0/ 8
rear = (rear + 1) % 8 · front = (front + 1) % 8 — classic array circular queue.