Cambridge A Level Computer Science 9618 – P2.05 Stepwise refinement and logic statements

Bespoke, fully editable lesson for Cambridge International AS & A Level Computer Science (9618): P2.05 Stepwise refinement and logic statements. Slides, worksheet and full answers.

Written for Paper 2 Problem-solving and Programming, section 9 Algorithm design and problem-solving (syllabus 9.2.8, 9.2.9). Everything is editable, so you can adapt it to your class.

What’s included

• PowerPoint lesson (15 slides) with teacher notes on every slide
• Student worksheet (Word), ready to print or edit
• Answer sheet (Word) with mark-scheme style answers for every question

P2.05 Stepwise refinement and logic statements

By the end of the lesson students can:

• Use stepwise refinement to take an algorithm from an outline to steps that can be programmed
• Write logic statements with relational operators and AND, OR and NOT
• Evaluate a logic statement step by step, using brackets to fix its meaning

Worksheet sections: A. Key words; B. Logic statements; C. Stepwise refinement; D. Exam-style questions; E. Challenge

Every lesson includes

• Learning goals and a starter question
• Clear explanations, diagrams and worked examples (Cambridge pseudocode, as in the 2027–2029 pseudocode guide, with Python alongside)
• A quick check and a “your turn” task linked to the worksheet
• Exam-style questions with marks, and an exit ticket

Format

• PowerPoint (.pptx) and Word (.docx), fully editable
• Works in PowerPoint and Google Slides
• Calm, muted sixth-form design, consistent across the whole course

These are independent resources written for the Cambridge International AS & A Level Computer Science syllabus (9618) for examination in 2027, 2028 and 2029. They are not produced or endorsed by Cambridge University Press & Assessment. Syllabus point numbers are our own numbering of the syllabus statements.