Preview
IB DP Computer Science — B2 Programming — Data structures | SL | B2.2.4
📋 What You Will Learn
- Explain FIFO and why a queue adds at one end (rear) and removes at the other (front)
- Define and use the fundamental operations: enqueue , dequeue , front , isEmpty
- Trace a sequence of queue operations, showing the queue's state after every step
- Explain how queue operations impact performance and memory — including why a naive list queue is slow
- Choose (and justify) a queue for problems such as print spooling, ticketing and buffering
🎟️ Why This Matters A queue at the canteen till: you join at the back, you are served at the front, and nobody jumps the line. Computers rely on the same fairness constantly — print jobs, keystrokes, network packets and support tickets are all handled in the order they arrived.
What a Queue Is
📖 Definition — Queue A queue is a first in, first out (FIFO) data structure: elements are added at the rear (enqueue) and removed from