-
Priority Queue
What is Priority Queue? Explain with example.
Suresh-Blore
- Jul 25th, 2011
Waiting queue may not operate on strictly first in first out basis,,but on some complex priority scheme based on such factors as what compiler is being used,the execution time required,number of print lines etc.The resulting queue is called Priority queue.
Vishesh Bibhay
- Jul 9th, 2011
Hello!priority queue is a data structure which exhibits two properties1.structure property2.order propertyStructure property means that the queue will be a complete binary treeOrder property ...
-
Circular Queue
What is Circular Queue? Explain with examples.
siddhi parkar
- Jul 6th, 2014
In linear queue once the size is full we cannot add another items cause rear is at rightmost .
but in circular list to add element even if its full you will move front and rear in clockwise direction.piyushbeli
- Apr 13th, 2009
In a normal Queue when queue becomes full we can not add more items, so following items are lost. But in a circular queue when queue becomes full it will start overwriting the items from beg...
