/kjuː/
noun — "ordered collection for sequential processing."
Queue is an abstract data structure that stores a sequence of elements in a specific order for processing. The most common ordering principle is FIFO (First In, First Out), though variations like priority queues may alter the processing sequence. A queue ensures that elements are handled systematically, supporting predictable workflows and task management in computing systems.
Technically, a queue supports at least two core operations: enqueue, which adds an element to the back of the queue, and dequeue, which removes an element from the front. Additional operations may include peeking at the front element without removing it, checking size, or verifying emptiness. Queues are implemented using arrays, linked lists, or ring buffers, and are widely used in operating system scheduling, network packet management, and asynchronous task handling.
In workflow terms, a print server maintains a queue of print jobs: documents submitted first are printed first, ensuring fairness and order. In network systems, packets entering a router may be queued for processing to prevent congestion and maintain sequence integrity.
Conceptually, a queue is like a line of people waiting at a service counter: each person is served in the order they arrived, maintaining orderly and predictable progression.