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
3694 Points
1484 Points
1432 Points
1372 Points
1311 Points
1194 Points
1114 Points
930 Points
922 Points
896 Points
1950 Points
1306 Points
502 Points
410 Points
388 Points
Gatecse
@Arjun Sir the problem is not with the ...