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
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

Abstract data type The thing which makes an abstract data type abstract is that its carrier set and its operations are mathematical entities, like geometric objects or numbers;

Warnock's Algorithm An interesting approach to the hidden-surface problem was presented by Warnock. His method does not try to decide exactly what is happening in the scene but

Area Subdivision Method In this method, the viewport is examined for clear decisions on the polygons situated in it, in regard to their overlap and visibility to the viewer. Fo

N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

Define min-heap A min-heap is a complete binary tree in which each element is less than or equal to its children. All the principal properties of heaps remain valid for min-hea

b) The user will roll two (six-sided) dices and the user will lose the game if (s)he gets a value 1 on either any of the two dices & wins otherwise. Display a message to the user w

Q. Write down an algorithm to convert an infix expression into the postfix expression.     Ans. Algo rithm to convert infix expression to post fix expression is given as

So far, we now have been concerned only with the representation of single stack. What happens while a data representation is required for several stacks? Let us consider an array X

What are the structures used in file-system implementation? Several on-disk and in-memory structures are used to execute a file system a. On-disk structure include P