0
A circular queue is a Queue but a particular implementation of a queue. It is very efficient. It is also quite useful in low level code, because insertion and deletion are totally independant, which means that you don't have to worry about an interrupt handler trying to do an insertion at the same time as your main code is doing a deletion.
Still curious? Ask our experts.
Chat with our AI personalities
Coach
Judy
BlakeThe 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.
No. 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 and 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.
Add your answer:
Earn +20 pts
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 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 circular queue .operations circular queue.?
Queue is difined as a special type of data structure .where elements are inserted one end &elements are deleted same end .The end from where they elements are inserted is called as "Rear end".The end from where elements are deleted is called "Front end". A linear queue is akin to the queue at the post office: it can be envisioned to be linear in space, and limited in space. When a linear queue of finite capacity is full, new arrivals are turned away (elements cannot be added, post office customers walk away). A circular queue behaves just like a normal queue, but is typically implemented in a a structure akin to a circle. The typical behavior is that the circular queue, when full, does not turn new entries away, but makes space by removing the oldest element in the queue. Of course, a queue might also be implemented to be of infinite, or virtually infinite, capacity.
Is queue a linear data structure?
Yes. A queue is a container to provide First-in-First-out operations on the items added and deleted from the container. These operations makes a queue being linear. And because the items inside this container do not interact with the container, they are just "data" to the container, hence a queue indeed is a LINEAR data structure. One would argue that a queue may have other ways to store queued elements in database, files, any external storage that are not linear (1 dimension). However, the bottom line is, to be a queue, it must guarantee First-in, First out, and a "ticket" is attached to each items, and those tickets are in sequential order, and hence it is a linear list or collection.
What is the definition of circular queue?
A queue is simply a FIFO i.e first in first out. In queue we've front and rear. Front is the initial or first location of the queue whereas rear indicates the last entry location in the queue. In the circular queue the location of front and rear will be the same IF the total space of the circular queue is utilized. Each element has its position no. for insertion , if we set the 5th element as the front element then after every insertion the ptr indicates the 5th element as front. in deletion, the fifth element is deleted every time it is the rear position. after deletion of an element the queue rotates and every time the rear indicates the 5th element of the circular queue. and every time the 5th location element is deleted.
