Question

what are the disadvantages of linear queue? How can we overcome these advantages in case of circular queue?​

Answer 1

Answer:

ggghhjtfhcuguvjcjffuzdhh vjvyx bkge

Answer 2

Answer:

This is the answer

Explanation:

It means in circular queue first position after last position. If front=0 and rear=N-1 or front=rear+1, then circular queue is full and we can't perform insertion of new element and overflow condition will occur. If rear=N-1 and front is not equal to 0, then we set rear=0 for insertion of new element.

Please mark me brainlist