Both A and B.
In circular queue, if we insert n elements then Rear = Front represents both empty queue and Completely full queue. To avoid ambiguity we declare circular queue full after inserting only N - 1 elements.
Simple Queue
As we know the overflow condition of simple queue is
If (REAR = MAX) then
Overflow
The linear queue suffers from serious drawback that performing some operations, we can not insert items into queue, even if there is space in the queue. Suppose we have queue of 5 elements and we insert 5 items into queue, and then delete some items, then queue has space, but at that condition we can not insert items into queue.
So A is the answer
Why not (B) ??
check this out :
http://nptel.ac.in/courses/106103069/Module_3/queue/circular_queue.htm
look at the link u provide..
the memory is utilized more efficient in case of circular queue's.
in cicrcular queue as we can again go back to the first node from the last node ...so we can utilize those vacant places.But in simple queue we cant
23438 Points
17108 Points
8344 Points
6314 Points
5458 Points
5008 Points
4882 Points
4390 Points
3996 Points
3838 Points
Gatecse
X->YZ , Y->XZ , ...