Teachers' Portal  /  A-Level Computer Science 9618  /  Algorithm design and problem-solving
Topic plan · A-Level Computer Science 9618 · Topic 9

Algorithm design and problem-solving

Abstraction and decomposition, then writing algorithms as structured English, flowcharts and pseudocode, and stepwise refinement.

Open the topic lab Question bank Notes PDF
Unit at a glance

3 lessons, 135 minutes of teaching

Lessons
3, each planned for 45 minutes
Worksheets
3 with answer keys
Quiz questions
18 multiple-choice, assignable in the app
Lab
Pseudocode lab
Scheme of work

The lessons in order

RefLesson packStructureWorksheetQuizLab tab
9.1Abstraction and decomposition
Before any code is written, a programmer has to make a real problem small enough to solve.
Connect-Extend-Challenge6 Q, 18 marks6 MCQtab 5
9.2Structured English, flowcharts and pseudocode
An algorithm is a sequence of defined steps that solves a problem.
Anticipation / Reaction Guide6 Q, 19 marks6 MCQtab 1
9.2Stepwise refinement
Nobody writes a complete program straight from a one-line problem statement.
Cooperative Concept Mapping6 Q, 16 marks6 MCQtab 3

Each pack holds the plan, worksheet and quiz for its lesson. Teach the rows in order; the lab tabs match the student lessons.

Also for this topic

Topic resources