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
Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

a. Determine the result of inserting the keys 4,19, 17, 11, 3, 12, 8, 20, 22, 23, 13, 18, 14, 16, 1, 2, 24, 25, 26, 5 in order to an empty B-Tree of degree 3. Only draw the configu

Define the terms     i) Key attribute     ii) Value set  Key attribute:  An entity  type  usually  has  an attribute  whose  values  are  distinct  fr

Define the Carrier set of the Symbol ADT Carrier set of the Symbol ADT is the set of all finite sequences of characters over Unicode characters set (Unicode is a standard char

What are the Dynamic arrays Dynamic arrays are convenient for programmers since they can never be too small-whenever more space is needed in a dynamic array, it can simply be e

Game trees An interesting application of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can picture the sequence of possible moves by m

Suppose you are given the results of 5 games of rock-paper-scissors. The results are given to you on separate pieces of paper; each piece says either 'A' if the first person won, o

Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + ( p * q + r ) * s , Follow general precedence rule and suppose tha

A stack is a last in, first out (LIFO) abstract data type and sequential data structure. A stack may have any abstract data type as a component, but is characterized by two fundame

A geography class decide to measure daily temperatures and hours of sunshine each day over a 12 month period (365 days) Write an algorithm, using a flowchart that inputs tempera