Abstraction, Decomposition and Modelling
Representing the essential features of a problem, dividing it into manageable parts and selecting a model whose assumptions are suitable for the purpose.
How to study A-level Computer Science
Define the problem and representation, trace the state change, justify the algorithm or architecture, then test the result against requirements, evidence and constraints.
Core concepts
Concept 1
Abstraction suppresses irrelevant detail while retaining the state, behaviour and relationships needed to solve the problem.
Exam cue: State what information is retained, what is omitted and why the omission is safe.
Concept 2
Decomposition produces smaller components with clear responsibilities, inputs, outputs and dependencies.
Exam cue: Give each subproblem one coherent responsibility and define how it interacts with the rest.
Concept 3
A computational model is useful only within its assumptions, representation choices and validation evidence.
Exam cue: Test the model against representative, boundary and exceptional real-world cases.
Risk pitfalls and guardrails
Treating abstraction as simply removing as much detail as possible.
Guardrail: Do not substitute a memorised definition or generic advantage until you have identified the input, state, stakeholder and constraint in the task.
Splitting a problem without defining the interfaces between parts.
Guardrail: Do not substitute a memorised definition or generic advantage until you have identified the input, state, stakeholder and constraint in the task.
Assuming a model is correct because the program runs.
Guardrail: Do not substitute a memorised definition or generic advantage until you have identified the input, state, stakeholder and constraint in the task.
Memory anchors
Abstraction
Retain the essential properties of a problem while hiding irrelevant detail.
Decomposition
Break a complex problem into smaller, connected subproblems.
Model
A model is a purposeful representation with explicit assumptions and limits.
Interface
An interface defines how components exchange data or services.
Validation
Validation asks whether the model represents the intended real-world problem sufficiently well.
Checkpoint rule
Do the check-up only after you can summarize each concept in one sentence and identify one dangerous pitfall from memory.
Knowledge Check (after reading)
Short check-up to confirm understanding of this module.
Check-up Questions
A route-planning model stores junctions and road lengths but omits building colours. Which computational-thinking technique justifies the omission?
A school timetabling problem is divided into room allocation, teacher availability and clash checking. What is this division called?
Answer all questions to submit.
Next step personalized recommendations
Continue learning
Move forward only after this module is stable.
What is Pass Harbor?
Completely free exam prep for 247 UK exams.
- Practice questions
- Flashcards
- Study guides
- Mock exams
- No registration
- No paywall
- Start instantly
“No more expensive exam prep. Quality study tools should be accessible to everyone.”