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 CAM software CAD/CAM software has been recognized as an essential tool in the designing and manufacturing of a product due to its ability to depict the designs and tool

Explain Internal and External Nodes  To  draw  the  tree's  extension  by  changing  the  empty  subtrees  by  special nodes. The  extra  nodes shown by little squares are know

Explain th term input and output-  Pseudocode Input and output indicated by the use of terms input number, print total, output total, print "result is" x and so on.

The disadvantages or limitations of the last in first out costing method are: The election of last in first out for income tax purposes is binding for all subsequent yea

Question 1 Explain the use of algorithms in computing Question 2 Explain time complexity and space complexity of an algorithm Question 3 Explain how you can analyz

State the example of pre- and post-conditions Suppose that function f(x) should have a non-zero argument and return a positive value. We can document these pre- and post-condit

Question 1 What is a data structure? Discuss briefly on types of data structures Question 2 Explain the insertion and deletion operation of linked list in detail Qu

This method is the reverse of FIFO and assumes that each issue of stock is made from latest items received in the enterprises .Thus if the last lot to be received is not sufficient

Painter's Algorithm As the name suggests, the algorithm follows the standard practice of a painter, who  would paint the background (such as a backdrop) first, then the major d

Determine the importance of array Arrays are significant since they allow many values to be stored in a single data structure whereas providing very fast access to each value.