if thhis is ur home work u shouldnt cheat u dont learn anything from cheating
2006-12-21 20:29:19
·
answer #1
·
answered by Anonymous
·
0⤊
2⤋
Circular queue is also known as a ring buffer. Why do you want to do this? It's fast. You don't have ot allocate anything. You allocate a buffer big enough once and then you just rotate which element in the array that you're using. If you reach the end of the buffer you just go back to the beginning by which time those elements have already been poped off. The trick is to pop things off the queue faster than you are pushing them on, which is always a good idea. The limitations is you have to know the max size of the queue before hand. You don't have to allocate additional memory.
2006-12-21 20:39:16
·
answer #2
·
answered by To Be Free 4
·
1⤊
0⤋
i think becoz circular queues can hav 2 ends..for approaching at a particular counter..
2006-12-21 20:31:53
·
answer #3
·
answered by Andrew goel 2
·
0⤊
1⤋
well geek... cuz less space is required in a circular 1...linear can stretch 4ever...stop askin nerdy questions man!!! geez
2006-12-21 20:34:22
·
answer #4
·
answered by Nakul S 1
·
0⤊
1⤋
The answer to this question is actually very simple. HOWEVER, I will not tell you because you should do your own computer science homework, sheesh!!
2006-12-21 20:30:08
·
answer #5
·
answered by Jay S 2
·
0⤊
1⤋