Collection - Queue (FIFO)

1 - About

A queue is collection:

  • that follows a first-in, first-out methodology
  • where the first element is the first element to be retrieved
  • where the concept of first may be defined.

For instance, first may be define as

If the queue has a fixed size (capacity), adding an element will delete the oldest one.

A stack follows the inverse methodology last-in, first-out (LIFO).

3 - Theory

Queueing_theory is the mathematical study of waiting lines

4 - Type

5 - Performance

6 - Documentation / Reference

Data Science
Data Analysis
Data Science
Linear Algebra Mathematics

Powered by ComboStrap