Cambridge IGCSE/O Level Computer Science (0478) – Paper 2

Lesson Plans: First 4 Weeks

Teaching context: 1 period = 35 minutes. Lessons are taught on Wednesday (P1–P2) and Friday (P1–P4). Total contact time per week: 6 periods (210 minutes).

Day Periods Total Minutes Notes

Wednesday P1–P2 (2 periods) 70 First two periods in the morning

Friday P1–P4 (4 periods) 140 Four consecutive periods

Weekly total 6 periods 210 Two teaching days per week

WEEK 1 – Program Development Life Cycle & Testing

Day Period(s) Lesson Focus Teacher Input Learner Activities

Wednesday P1–P2 PDLC overview (stages + purpose) Teach PDLC stages and outputs of each Workbook 1 tasks: PDLC matching and
stage. Link each stage to what exam short explanations; then 1–2 short
questions usually ask. past-paper questions (2023–2025) focused
on PDLC definitions.

Friday P1–P2 Design tools (flowcharts + pseudocode) Model a simple IPO problem in flowchart Workbook 1 tasks on flowchart
then pseudocode. Emphasise symbols/IPO; attempt one past-paper
Cambridge-style conventions. algorithm design question (2023–2025).

Friday P3–P4 Testing & test data Explain test data categories and how to Workbook 1 testing questions; use textbook
(normal/boundary/extreme/abnormal) select values. Show typical mark-allocation examples/solutions; finish with a short
approach (name + example + justification). past-paper test-data question (2023–2025).
WEEK 2 – Validation and Verification
Week ending: Friday, 23 January 2026 Study Guide: Module 5 + Workbook 8 + Study Key 8 Textbook: Helen Williams – Validation & Verification Exam practice: Topic questions from past
papers (2023–2025)

Day Period(s) Lesson Focus Teacher Input Learner Activities

Wednesday P1–P2 Validation (checks + when to use) Teach the standard validation checks and Workbook 8 tasks: identify suitable checks;
typical scenarios. Demonstrate how checks write short justifications; complete one
appear in pseudocode. past-paper item (2023–2025) on choosing a
check.

Friday P1–P2 Verification (methods + purpose) Teach double entry and visual check. Workbook 8 tasks: classify validation vs
Contrast with validation: reasonableness vs verification; correct common
accuracy. misconceptions using study key + textbook
solutions.

Friday P3–P4 Exam application (validation vs verification) Model full-mark explanations using Timed past-paper questions (2023–2025)
command terms (define/describe/explain). on validation/verification; peer-mark using
Highlight common pitfalls (mixing terms; model answers; improvement rewrite.
vague examples).
WEEK 3 – Consolidation and End-of-Month Test
Week ending: Friday, 30 January 2026 Test policy: End-of-month test (every month) Test source: Past-paper-style question paper built from 2023–2025 questions

Day Period(s) Lesson Focus Teacher Input Learner Activities

Wednesday P1–P2 Revision (PDLC + Testing) Rapid recap and targeted re-teach of weak Mixed revision set: Workbook 1 review
areas from Workbook 1 / Study Key 1. questions + 2 short past-paper questions
(2023–2025).

Friday P1–P2 Revision (Validation + Verification) Summarise checks/methods. Model 2–4 Workbook 8 review questions + 2 short
mark responses and how to earn each past-paper questions (2023–2025).
mark.

Friday P3–P4 END-OF-MONTH TEST Set and invigilate. Test covers only taught Students sit a past-paper-style test
content: PDLC, testing, validation & compiled from 2023–2025 Paper 2
verification. questions. (Mark using mark scheme;
record performance.)
WEEK 4 – Standard Algorithms (Count, Total, Average, Max, Min)
Week ending: Friday, 6 February 2026 Study Guide: Module 4 (Algorithms 1–5) + Integrated tasks Textbook: Helen Williams – Standard Algorithms (worked examples + exercises) Exam
practice: Topic questions from past papers (2023–2025)

Day Period(s) Lesson Focus Teacher Input Learner Activities

Wednesday P1–P2 Algorithm patterns: counter vs accumulator; Introduce standard algorithms as reusable Study Guide Module 4 Algorithm 1–2 drills
count & total patterns. Teach algorithm skeletons and (count/total); trace-table practice; short
trace-table approach. past-paper algorithm-tracing item
(2023–2025).

Friday P1–P2 Averaging (Algorithm 3) + common exam Teach averaging algorithm; emphasise: Algorithm 3 practice: compute average from
trap division must be AFTER the loop; link to multiple inputs; learners write pseudocode +
mark-scheme wording. trace; textbook exercise/check answers.

Friday P3–P4 Maximum & Minimum (Algorithms 4–5) + Teach max/min initialisation and update Algorithm 4–5 practice: max/min from a
mixed practice logic. Show typical marking points: initial list/array; then a mixed task combining total
values, comparisons, correct updates. + average + max/min. Finish with a
past-paper style question (2023–2025)
targeting these algorithms.