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
5174 Points
4730 Points
3504 Points
3492 Points
3188 Points
2700 Points
2432 Points
2244 Points
2090 Points
1874 Points
Gatecse
thanks for these Motivating words ...
You can also upload COURSE AND ...