-
If the size of the array used to implement a circular queue is MAX_SIZE. How rear moves to traverse inorder to insert an element in the queue?
-
- rear=rear%(MAX_SIZE+1)
- rear=rear+(1%MAX_SIZE)
- rear=(rear+1)%MAX_SIZE
- rear=(rear%1)+MAX_SIZE
- None of these
Correct Option: C
The front and rear pointer od circular queue point to the first element.
