
Bespoke, fully editable lesson for Cambridge International AS & A Level Computer Science (9618): P2.03 Sequence, selection and iteration. Slides, worksheet and full answers.
Written for Paper 2 Problem-solving and Programming, section 9 Algorithm design and problem-solving (syllabus 9.2.4). Everything is editable, so you can adapt it to your class.
What’s included- PowerPoint lesson (14 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
By the end of the lesson students can:
- Recognise sequence, selection and iteration in an algorithm
- Write each of the three constructs in Cambridge pseudocode
- Trace an algorithm that uses all three with a trace table
Worksheet sections: A. Key words; B. Trace the algorithms; C. Write pseudocode; 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
- 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.
Get this resource as part of a bundle and save up to 40%
A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place.
Cambridge A Level Computer Science 9618 – Paper 2 Part 1 (P2.01–P2.20) – Bundle (20 lessons)
A ready-to-teach bundle for **Cambridge International AS & A Level Computer Science (9618)**: Paper 2 Problem-solving and Programming, part 1, lessons P2.01 to P2.20. Every lesson comes with: - **Editable PowerPoint slides**: goals, starter, explanations, diagrams, worked examples, a quick check, a task and an exit ticket, with teacher notes - **Student worksheet (Word)**: recall, applied practice and exam-style questions with marks - **Answer sheet (Word)**: full mark-scheme style answers Worth £99.80 if bought lesson by lesson. ## What's inside **Section 9 Algorithm design and problem-solving** - P2.01 Abstraction and decomposition - P2.02 Algorithms and identifier tables - P2.03 Sequence, selection and iteration - P2.04 Structured English and flowcharts - P2.05 Stepwise refinement and logic statements **Section 10 Data types and structures** - P2.06 Data types, variables and constants - P2.07 Records - P2.08 One-dimensional arrays - P2.09 Two-dimensional arrays - P2.10 Linear search - P2.11 Bubble sort - P2.12 Text files - P2.13 Abstract data types and stacks - P2.14 Queues - P2.15 Linked lists **Section 11 Programming** - P2.16 From design to pseudocode - P2.17 Built-in functions and strings - P2.18 IF and CASE - P2.19 Choosing the right loop - P2.20 Procedures ## Why teachers use it - Mapped lesson by lesson to the syllabus, so coverage is easy to track - Cambridge pseudocode, as in the 2027–2029 pseudocode guide, with Python alongside - Fully editable: adapt to your class, timings and school template 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.
Cambridge A Level Computer Science 9618 – Section 9 Algorithm design and problem-solving (5 lessons)
A complete, ready-to-teach bundle for **Cambridge International AS & A Level Computer Science (9618)**: Section 9 Algorithm design and problem-solving, in 5 bespoke lessons. Every lesson comes with: - **Editable PowerPoint slides**: goals, starter, explanations, diagrams, worked examples, a quick check, a task and an exit ticket, with teacher notes - **Student worksheet (Word)**: recall, applied practice and exam-style questions with marks - **Answer sheet (Word)**: full mark-scheme style answers Worth £24.95 if bought lesson by lesson. ## What's inside - **P2.01** Abstraction and decomposition - **P2.02** Algorithms and identifier tables - **P2.03** Sequence, selection and iteration - **P2.04** Structured English and flowcharts - **P2.05** Stepwise refinement and logic statements ## Why teachers use it - Mapped lesson by lesson to the syllabus, so coverage is easy to track - Cambridge pseudocode, as in the 2027–2029 pseudocode guide, with Python alongside - Fully editable: adapt to your class, timings and school template - Works for teaching, revision, cover lessons and homework 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.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.