Oak ComputingTest · Computing

Tracing algorithms

The starter and exit quiz of the lesson “Tracing algorithms”, from the unit “Algorithms” (Year 10 Computing) by Oak National Academy.

Free to use. Edit it, share it and hand it out to your students.

Oak National Academy

12 questions

What is a set of step-by-step instructions to solve a problem called?
Why is it helpful to develop an algorithm’s logic before coding?
What is a diagram that represents logic or data (or similar alternatives)?
What does decomposition involve?
What is abstraction in computational thinking?
What is a way to express an algorithm in plain language (or similar alternatives)?
Match the terms with their definitions.
What is a trace table used for?
What is a common limitation of trace tables?
What is the result of 10%3?
Arrange these steps into the correct order for creating a trace table.
Why might trace tables be impractical for complex algorithms?

License: OGL