Resources included (20)

Procedures – A Level Computer Science 9618 lesson

Choosing the right loop – A Level Computer Science 9618 lesson

IF and CASE selection – A Level Computer Science 9618 lesson

Built-in functions and strings – A Level Computer Science 9618

From design to pseudocode – A Level Computer Science 9618 lesson

Linked lists – A Level Computer Science 9618 lesson

Queues – A Level Computer Science 9618 lesson

Abstract data types and stacks – A Level Computer Science 9618

Text files – A Level Computer Science 9618 lesson

Bubble sort – A Level Computer Science 9618 lesson

Linear search – A Level Computer Science 9618 lesson

Two-dimensional arrays – A Level Computer Science 9618 lesson

One-dimensional arrays – A Level Computer Science 9618 lesson

Records – A Level Computer Science 9618 lesson

Data types, variables and constants – A Level CS 9618 lesson

Stepwise refinement and logic statements – A Level CS 9618 lesson

Structured English and flowcharts – A Level Computer Science 9618

Sequence, selection and iteration – A Level Computer Science 9618

Algorithms and identifier tables – A Level Computer Science 9618

Abstraction and decomposition – A Level Computer Science 9618
20 ready-to-teach lessons for Cambridge International AS & A Level Computer Science (9618): Paper 2 Part 1. Every lesson has editable PowerPoint slides, a student worksheet and full answers, and the bundle costs less than buying the lessons one by one.
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 insideSection 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
- 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.
Last updated: November 2026.
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.
