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?
A. rear=(rear%1)+MAX_SIZE
B. rear=(rear+1)%MAX_SIZE
C. rear=rear+(1%MAX_SIZE)
D. rear=rear%(MAX_SIZE+1)
Answer: Option B
Join The Discussion