Build understanding in Computer Science with one-to-one online lessons for Cambridge International. Share your level, current topic and school specification so the tutor can focus on the next skill you need.
Primary · Lower Secondary · IGCSE · AS & A LevelLive online support
Trace a program before running it. Track how values change and test ordinary, boundary and invalid inputs. An algorithm should explain a repeatable method independently of a specific interface.
02
Match practice to your actual course
Cambridge stages and school year labels are not interchangeable. Support is subject-specific; schools decide which programmes and assessments to offer. Early Years is a separate play-based programme; discuss readiness before requesting tutoring. Primary · Lower Secondary · IGCSE · AS & A Level. Your school’s subject choices, topic sequence and assessment tasks determine the detailed plan. The practice set below samples algorithms, python and debugging; it is not a complete syllabus or an official exam paper.
03
Prepare a useful question for your tutor
Bring one attempted question and show your working or first draft. Explain what you tried and where the reasoning stopped. Together, identify whether the difficulty is confusing assignment with equality or a missing prerequisite, then try a fresh problem independently.
Understand it. Try it. Review it.
Put your computer science learning into practice.
Worked example · Algorithms, Python and debugging
What does this Python code print? total = 0; then for n in [2, 4, 6]: total = total + n; then print(total).
Start at total = 0.
After each iteration the total is 2, then 6, then 12.
Preview the worksheet 