FIFO, means "First In, First Out". An example of such a data structure is a queue.

Circular queue is a linear data structure that follows the First In First Out principle. A re-buffering problem often occurs for each dequeue operation in a standard queue data structure. This is solved by using a circular queue which joins the front and rear ends of a queue.

Queue is a data structure which is based on FIFO that is first in first out. Following are the types of queue: Linear queue Circular queue Priority queue Double ended queue ( or deque )

Array, Stake, Queue.

A batch queue is a system software data structure maintained by job scheduler software.