A circular queue is implemented using an array of size 10. The array index starts with 0,

Question:

A circular queue is implemented using an array of size 10. The array index starts with 0, the front is 6, and the rear is 9. The insertion of the next element takes place in the array index.

A. 0

B. 7 

C. 9 

D. 10

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: