Circular Queues

Question 1

adding an item to a circular queue

Answer 1

1. Check the queue is not already full
2. Compare the value of the (rear) pointer with the maximum size of the array
3. If equal then (rear) pointer becomes zero
4. Otherwise, add one to the (rear) pointer
5. Insert new item in position indicated by (rear) pointer

Question 2

removing an item from a circular queue

Answer 2

1. Check the queue is (not already) empty
2. Compare the value of the front pointer with the maximum size of the array
3. If equal then front pointer becomes one
4. Otherwise, add one to the front pointer