0
Still curious? Ask our experts.
Chat with our AI personalities
Rene
Rafa
JudyAdd your answer:
Earn +20 pts
How compiler differentiate between linear queue and circular queue?
It doesn't.
Circular queue in linear data structure?
The queue is a linear data structure where operations of insertion and deletion are performed at separate ends also known as front and rear. Queue is a FIFO structure that is first in first out. A circular queue is similar to the normal queue with the difference that queue is circular queue ; that is pointer rear can point to beginning of the queue when it reaches at the end of the queue. Advantage of this type of queue is that empty location let due to deletion of elements using front pointer can again be filled using rear pointer.
What is queue explain the basic element of queue?
The queue is a linear data structure where operations of insertion and deletion are performed at separate ends also known as front and rear. Queue is a FIFO structure that is first in first out. Following are the types of queue: Linear queue Circular queue Priority queue Double ended queue ( or deque )
What is the difference between linear and circular queue?
What is the difference between linear and circular queue? In: http://wiki.answers.com/Q/FAQ/2545-37 [Edit categories]The Queue by Default is Linear, it would be termed as Circular if the Last Element of the Queue pointsto the first element of the List
What is the limitation of linear queue and how do you overcome using circular queue?
in linear queue when any element is pop out than we do size-1 value changing ie like in the pile of coin when we take out the last coin then all changes there places so likewise we have to change the position of each element..... we can overcome by circular one as we have to change the value of the first and last not the values changes in the array.... but circular queue also had limitation that either u have to use it as size-1 queue or it will show you full even though it is empty fully....as first==last...
