AI engineering glossary · Data structures algorithms
What is FIFO (queue)?
Queue (also called FIFO): A collection where items are added at the back and removed from the front, so the oldest item leaves first (first in, first out). It models waiting lines and work that must be handled in arrival order.
Queue: an example
A ticket-booking system serves requests in arrival order: the request that arrived first is processed first, using a queue.
Related terms
More Data structures algorithms terms
- Quickselect
- Quicksort
- Radix sort
- Randomized algorithm
- Recurrence relation
- Recursion
- Red-black tree
- Reservoir sampling
Where you learn it
Queue is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.