AQA A-level Computer Science (7517)Specification point 4.2.2.1

AQA 7517 4.2.2.1: Queues

The free BugBot lesson that teach this point, a robot to try it on, and the past-paper questions that test it.

What it covers

A robot that takes commands over the radio cannot always act on them as fast as they arrive. It keeps them in a queue: the first command in is the first one carried out. This lesson builds queues three ways, and uses the most useful of them, the circular queue, as BugBot's command buffer.

  • The queue
  • A linear queue
  • The circular queue
  • Priority queues
  • Where queues are used
Read the free lesson (20 min)

Or do it in the simulator, with tasks that mark themselves

Lessons that teach it

  1. A3.3 Queues: linear, circular and priority Data structures
    Front and rear pointers, wrapping round with MOD, and priority queues: a command queue for the robot.

Try it on a robot

The task from A3.3 Queues: linear, circular and priority, running here. Change the program and press Run.

The specification is AQA's own document; this page says which of our lessons teach point 4.2.2.1 and is not endorsed by the board.