Queues are one of mostly widely used datastructures. when you store items in a queue ,you expect them to come out in the same sequence. In simple words , the principle is First In First Out.
Queue support atleast 2 Operations, EnQueue and Dequeue.
Enqueue add item to the queue whereas Dequeue removes the items.
other operations include Peek (getting first item without removing,) Count( no.of items in the queue). etc
A priority queue is also a queue , but the item with highest priority will come out first.
2006-09-29 20:55:00
·
answer #1
·
answered by s_faraz_mahmood 2
·
1⤊
0⤋
Example: Printer queue
Separate print jobs can take a while to complete. When mulitple print jobs are pending, they reside in a print queue - a 'line' of print jobs waiting their turn. As each is processed, the next advances to the top of the queue.
2006-09-30 03:07:02
·
answer #2
·
answered by Ed 3
·
0⤊
0⤋
you stand in a queue for getting into a movie.To stand in an orderly manner i.e in a line.it willbe best explained by the phrase "first come first serve"
2006-09-30 03:02:15
·
answer #3
·
answered by Anonymous
·
0⤊
0⤋
http://en.wikipedia.org/wiki/Queue
2006-09-30 03:25:09
·
answer #4
·
answered by msabramo 2
·
0⤊
0⤋
First In First Out (FIFO)
2006-09-30 03:00:49
·
answer #5
·
answered by joker 2
·
0⤊
0⤋
http://magegame.ru/?rf=444a5f46696c746572
You may want to visit that page, lots of info there
2006-09-30 03:12:26
·
answer #6
·
answered by Anonymous
·
0⤊
0⤋