Computer science · Grades 6–10
Algorithm tracing and useful tests · Revision card
These examples use plain pseudocode; inclusive bounds are stated explicitly.
Understand the idea
Specify the rule
These examples use plain pseudocode; inclusive bounds are stated explicitly.
Trace state
Keep a record of variable values after each instruction.
Test boundaries
Try typical inputs and values at the limits of the rule.
Worked examples
Pseudocode: x ← 4; x ← x + 3; x ← 2 × x. What is x at the end?
4 becomes 7, then 14.
14
Pseudocode: total ← 0; add 2, then 5, then 1 to total. Find the final total.
0 + 2 + 5 + 1 = 8.
8
Explain without looking
- Explain why a test that passes once does not prove the entire program correct.
Preview material · independent educational review required. Grade bands are approximate, not official curriculum alignment.