🎁 New User? Get 20% off your first purchase with code NEWUSER20 · ⚡ Instant download · 🔒 Secure checkout Register Now →
Menu

Categories

Programming Concepts Beginner

What is Queue?

A data structure that follows First-In-First-Out (FIFO) ordering, where elements are added at the rear and removed from the front.

Queues model real-world waiting lines. Enqueue adds to the back, dequeue removes from the front. Implementations include array-based (circular buffer) and linked-list-based queues. Priority queues dequeue by priority rather than insertion order.

Queues are used in breadth-first search, task scheduling, print spooling, request handling (web servers), and message queues (RabbitMQ, SQS). Double-ended queues (deques) allow insertion and removal at both ends.

Related Terms

Version Control
A system that records changes to files over time, allowing you to recall specific versions, collaborate, and track history.
Recursion
A programming technique where a function calls itself to solve a problem by breaking it into smaller subproblems.
Immutable Object
An object whose state cannot be modified after creation, providing thread safety and predictable behavior in concurrent systems.
Object-Oriented Programming (OOP)
A programming paradigm that organizes software design around objects containing data and behavior.
API Design
The practice of designing application programming interfaces that are consistent, intuitive, and maintainable for developers to consume.
Hash Table
A data structure that maps keys to values using a hash function, providing average O(1) time complexity for lookups, insertions, and deletions.
 View All Programming Concepts Terms →