Python transition and execution

This module is about carrying an algorithm you already understand from Cambridge-style pseudocode into small, careful Python, and checking that the Python does what the algorithm says. You will map assignment, loops and selection, test indentation, tell a syntax error from a wrong result, use a safe browser runtime, and keep guidance for different exam years apart.

Python here is a tool for checking your reasoning. The examiner marks the algorithm and the logic, so the skill is to trace what the code does, not to memorise library tricks.

What should I know before starting?

You should be able to read and trace pseudocode with variables, IF and a FOR loop. If a trace table still feels uncertain, work through pseudocode for the applicable syllabus first, and repetition and arrays if loops over lists are new.

An orienting example

Here is a pseudocode loop and its Python version side by side.

Total ← 0
FOR Count ← 1 TO 4
   Total ← Total + Count
NEXT Count
OUTPUT Total

total = 0
for count in range(1, 5):
    total = total + count
print(total)

Both produce 10, because 1 + 2 + 3 + 4 = 10. Three differences matter: ← becomes =, NEXT and ENDIF disappear because indentation marks where a block ends, and range(1, 5) stops before 5. Every lesson in this module is about one of those differences going wrong.

In what order should I study the lessons?

1. Map an algorithm into a restricted Python function: the core translation skill, with a count-the-passes example.
2. Test indentation and branch structure: in Python the spaces are part of the logic.
3. Distinguish a syntax error from a wrong result: knowing which kind of fault you have tells you where to look.
4. Use a safe browser runtime without network or file access: what the sandbox allows and how to write exercises that fit it.
5. Keep 2029 Python-only assessment guidance separate from earlier requirements: label advice by exam year before you rely on it.

Then finish with the mixed practice set. The Python reasoning sandbox and the restricted pseudocode trace trainer let you run and trace small examples as you go.

What are the common traps?

• Writing = where Python needs == for a comparison.
• Forgetting that range(1, 5) stops at 4.
• Mixing two notations in one answer.
• Indenting a line one level too far or too little, so it runs at the wrong time.
• Treating “the program ran” as “the program is right”.
• Using advice written for a different exam year without checking.

How should I use the practice set?

Trace each question on paper first, then run it to confirm. When a question goes wrong, the “if you got these wrong” section sends you to the right lesson. Our online one-to-one Computer Science tuition is there when the same habit keeps repeating, and the syllabus for your exam year on the Cambridge page remains the authority on what is examined.