Define queue fifo ?, Data Structure & Algorithms

A queue is a particular type of collection or abstract data type in which the entities in the collection are went in order and the principal functions on the collection are the addition of removal of entities from the front terminal position and entities to the rear terminal position. This creates the queue a First-In-First-Out (FIFO) abstract data structure. In a FIFO data structure, the first component added to the queue will be the first one to be replaced. This is similar to the need that once an element is added, all components that were added before have to be replaced before the new component can be called. A queue is an example of a sequential data structure.

Queues give services in transport, computer science, and operations research where several entities such as objects, data, persons, or events are stored and held to be executed later. In these contexts, the queue acts the function of a buffer.

Queues are frequent in computer programs, where they are constricted as data structures coupled with access routines, as object-oriented languages or in an abstract data structure as classes.

 

1004_Queue FIFO.png

Posted Date: 7/27/2012 6:57:18 AM | Location : United States







Related Discussions:- Define queue fifo ?, Assignment Help, Ask Question on Define queue fifo ?, Get Answer, Expert's Help, Define queue fifo ? Discussions

Write discussion on Define queue fifo ?
Your posts are moderated
Related Questions
Explain Backtracking The  principal idea is to construct solutions single component  at a time  and evaluate such  partially constructed candidates as follows. If a partiall

I need to know about data structure and algorithms. can you help me?

Definition: A set of data values & related operations that are accurately specified independent of any particular implementation. As the data values and operations are described

algorithm for insertion in a queue using pointers

Multidimensional array: Multidimensional arrays can be defined as "arrays of arrays". For example, a bidimensional array can be imagined as a bidimensional table made of elements,


what are the charaterstics to determine weather an algorithm is good or not? explain in detail

Enumerate the Types in Ruby Ruby is a pure object-oriented language, meaning that all types in Ruby are classes, and each value in a Ruby program is an instance of a class. Thi

Circular Queues:- A more efficient queue representation is get by regarding the array Q(1:n) as circular. It becomes more convenient to declare the array as Q(O: n-1), when  re

State about the Bit String Carrier set of the Bit String ADT is the set of all finite sequences of bits, including empty strings of bits, which we denote λ. This set is {λ, 0