What is the first in first out data structure?

Answer 1

In computer programming, first-in first-out (short FIFO) describes a data structure which implements a chronological order, such that when multiple elements are added to the data structure, the normal retrieval method returns the elements in the order in which they were added.

FIFO structures are often used to implement queues and buffers. The alternative commonly used chronological sorting container is LIFO, short for last-in first-out.

Answer 2

Hi,

In terms of a set of objects, the frist-in-first-out approach consists in that the first object to have been added to the set will be the first to be let out. Such a structure would provide you with at least two basic operations: to add objects in, and to get objects out. And a structure built along this approach would not allow for the possibility of letting you choose which object to retrieve: the objects get out in the order they got in (or were put in, to be more specific).

A classic illustration and representation of this approach would be that of a tube the size of the objects you put in. You can add the objects only at one end, and get the objects back only at the other end. This way, you see that there is no way to get the objects in between. Of course, the size of the structure is not necessarily as limited as that tube, and depends on the implementation.

.

Valentin Laurent

Answer 3

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.