A circular queue is implemented using an array of size n = 10. The front and…
A circular queue is implemented using an array of size n = 10. The front and rear indices are at positions front = 3 and rear = 8. The queue currently contains 6 elements. If two more elements are inserted, what will be the new values of front and rear?
- A.
front = 3, rear = 1
- B.
front = 4, rear = 0
- C.
front = 3, rear = 0
- D.
front = 2, rear = 0
Attempted by 405 students.
Sign up free to check your answer
Sign up freeLoading lesson…