AQA GCSE Computer Science Tracing Algorithms Worksheet

AQA GCSE Computer Science tracing worksheet: identify and trace bubble sort, binary search and linear search code in Python. Full answer sheet included.

A three-page worksheet where students identify, explain and trace the three key algorithms from AQA GCSE Computer Science 3.1, written as Python code.

Three algorithms, one per page

• Algorithm 1: bubble sort
• Algorithm 2: binary search
• Algorithm 3: linear search

For each algorithm, students:

1. Name the algorithm
2. Describe its purpose
3. Complete a trace table
4. State what is returned or output

What’s included

• Student worksheet (editable Word document) with marks shown for each question
• Answer sheet with full trace tables, model answers in red, and a note explaining the trickiest step

Great for consolidation after the searching and sorting lessons, or as revision before the exam. Part of the AQA 3.1 Algorithms unit, also available as a complete bundle.