Queues Topic 5.1.4 / HL extension / 3 lessons
Key points
  • the characteristics (FIFO) and applications (print queues, modelling of physical queues e.g. supermarket checkouts) of a queue;
  • linear and circular implementations of a queue;
  • constructing algorithms using the access methods (enqueue, dequeue, isEmpty) of a queue;
  • the use of arrays as static queues.
Vocabulary
Resources
Related topics
Starter

Tasks
-->