0
A queue is a particular kind of collection in which the entities in the collection are kept in order and the principal operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed.
Some Applications:
1) Serving requests of a single shared resource (printer, disk, CPU), transferring data asynchronously (data not necessarily received at same rate as sent) between two processes (IO buffers), e.g., pipes, file IO, sockets.
2) Call center phone systems will use a queue to hold people in line until a service representative is free.
3) Buffers on MP3 players and portable CD players, iPod playlist. Playlist for jukebox - add songs to the end, play from the front of the list.
4) When programming a real-time system that can be interrupted (e.g., by a mouse click or wireless connection), it is necessary to attend to the interrupts immediately, before proceeding with the current activity. If the interrupts should be handles in the same order they arrive, then a FIFO queue is the appropriate data structure.
Wiki User
∙ 10y ago
Add your answer:
Earn +20 pts
What is fifo data structure?
FIFO, means "First In, First Out". An example of such a data structure is a queue.
How do you determine symmetry of a data structure For example how do you know if a Stack or a queue or a priority queue or a double ended queue are symmetric?
You can determine symmetry of a data structure in two ways. One is when the stacks and queues data are put in the application and when the stacks are put in during run-time.
Can stack be called fifo data structure?
No. A stack is a LIFO (Last In First Out) data structure.A queue is a FIFO (First In First Out) data structure.
Which data structure represents a waiting line and limits insertions to be made at the back of the data structure and limits removals to be made from the front?
Queue.
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 fifo data structure?
FIFO, means "First In, First Out". An example of such a data structure is a queue.
What is the need of circular queue in data structures?
Circular queue is a linear data structure that follows the First In First Out principle. A re-buffering problem often occurs for each dequeue operation in a standard queue data structure. This is solved by using a circular queue which joins the front and rear ends of a queue.
What are types of Queue?
Queue is a data structure which is based on FIFO 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 single dimension in data structure?
Array, Stake, Queue.
What is a batch queue?
A batch queue is a system software data structure maintained by job scheduler software.
How do you determine symmetry of a data structure For example how do you know if a Stack or a queue or a priority queue or a double ended queue are symmetric?
You can determine symmetry of a data structure in two ways. One is when the stacks and queues data are put in the application and when the stacks are put in during run-time.
What is most appropriate data structure to implement priority queue?
heap
What is first in first out data structure?
QUEUE is the first in first out (FIFO) data structure. It is a linear data structure in which insertion of an element is done from rear end of a list and deletion of an element is done from front end of a list. For example- people in queue waiting for bus.
Can stack be called fifo data structure?
No. A stack is a LIFO (Last In First Out) data structure.A queue is a FIFO (First In First Out) data structure.
Which data structure represents a waiting line and limits insertions to be made at the back of the data structure and limits removals to be made from the front?
Queue.
Where can Java Queue be downloaded?
A 'queue' is a particular kind of data structure that Java is capable of working with. There are no products called "Java Queue" and is thus not something one can download.
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 )
