Sequence 14 — Theory of Computation I

Computational problem solving, algorithm construction, abstraction, information hiding, procedural/functional/data abstraction, problem reduction, decomposition, composition and automation. AQA 4.4.1–4.4.11.

Computational Problem Solving

Analyse computational problems by identifying objectives, inputs, outputs, constraints and success criteria
Distinguish genuine constraints from inputs, objectives and success criteria

Following and Writing Algorithms

Interpret and trace algorithms expressed in pseudocode
Construct algorithms in pseudocode from a problem specification

Abstraction and Information Hiding

Explain abstraction and information hiding with technical precision, beyond a bare definition
Explain why a given abstraction remains valid even as its implementation changes

Procedural & Functional Abstraction

Distinguish between procedural and functional abstraction
Classify a given code example as primarily procedural or functional abstraction

Data Abstraction & Problem Reduction

Select appropriate abstract data representations for a given problem
Explain what a problem reduction preserves and what it changes

Decomposition, Composition & Automation

Break complex problems into manageable, genuinely independent components
Explain what composing decomposed components back together genuinely requires