Key vocabulary — one term per strand

Reviewing the whole unit

What this lesson is for

This is the final SDD lesson of the course. It introduces no new content — every fact, function, and concept below has already been taught and Python-verified somewhere in SDD1–21. Its purpose is consolidation: confirming that skills from every strand can still be recalled and applied together, not just immediately after the lesson that first taught them, and identifying specific gaps to close before the January prelim.

The coverage map

The SQA content map (§2 of the delivery plan) lists every mandatory strand: development methodologies, analysis, design, data structures, computational constructs, algorithm specification, testing, debugging, evaluation, and the applied cycle. Task Set A below is built directly from this table as a checklist — one question per strand, confirming nothing from the whole unit has been left untested by the time SDD22 finishes. This mirrors exactly how the checklist should be used when auditing any teaching unit for completeness, rather than trusting from memory that "everything's probably covered".

Why revisiting old lessons matters more than it feels like it should

A skill that felt solid immediately after SDD7's lesson on functions and procedures can genuinely fade by the time SDD22 arrives, five weeks and fourteen lessons later — this is a normal feature of memory, not a sign the original teaching failed. Deliberately testing every strand again now, rather than assuming earlier confidence still holds, is exactly why this review exists as its own lesson instead of simply trusting that SDD1–21's individual task sets were enough on their own. It is also why each question in Task Set A below deliberately links back to the specific lesson it came from, rather than being presented as an anonymous mixed quiz — knowing exactly which lesson a wrong answer traces back to is what turns a single test result into something genuinely useful for revision.

How this connects to what comes next

The prelim (historically the first three weeks of January 2027) and the actual question paper (May 2027) will both draw on this entire unit at once, exactly as SDD21's mixed-topic questions began rehearsing. Task Set B's reflection at the end of this lesson is deliberately designed to turn today's specific results into a concrete, prioritised revision plan for the weeks between now and the prelim — a generic feeling of "I should revise SDD" is far less useful than a specific list of which strands actually need the most attention. The same coverage map used to build today's test can be reused later, unchanged, as a personal revision checklist — ticking off each strand once it has been actively revisited, rather than only once it has been taught for the first time.

Worked examples — one strand recapped in full detail

Task Set A — Unit test

def calculateTotalCopies(copies):
    total = 0
    for i in range(len(copies)):
        total = total + copies[i]
    return total

# calculateTotalCopies([3, 5, 0, 2, 4]) returns 14

Task Set B — Extension