Key Terms
- Decomposition: Breaking a complex problem into smaller, more manageable sub-problems
- Abstraction: Removing unnecessary detail to focus only on what is important for solving the problem
- Pattern recognition: Identifying similarities, trends, or repeated structures within or between problems
- Algorithmic thinking: Developing a clear, step-by-step solution that a computer can follow
Must-Know Facts
- The four pillars of computational thinking: DAPA — Decomposition, Abstraction, Pattern recognition, Algorithmic thinking
- Decomposition makes large problems easier to tackle by dividing into smaller parts
- Abstraction creates models that hide complexity (e.g. London Tube map ignores real geography)
- Pattern recognition lets solutions be reused across similar problems
- Algorithmic thinking produces the step-by-step instructions a program will follow
- These skills apply to ALL problem solving — not just computing
Key Concepts
- Decomposition: large problem → sub-problems → each solved independently
- Abstraction: keep essential details, discard irrelevant ones (variables abstract memory addresses)
- Pattern recognition: spot repeated structures → apply same solution (e.g. all logins need validation)
- Algorithmic thinking: precise, ordered steps with no ambiguity
Common Mistakes
- Confusing abstraction with decomposition: Decomposition breaks a problem into smaller parts; abstraction removes unnecessary detail to focus on what matters — they are different skills
- Describing abstraction as "making things simple": Abstraction specifically means removing irrelevant detail to create a useful model — "simplification" alone is too vague for exam marks
- Forgetting pattern recognition as a pillar: Many students name only decomposition and abstraction — pattern recognition and algorithmic thinking are equally important and examiners expect all four
- Saying computational thinking only applies to programming: These four skills apply to any problem-solving context — examiners use real-world scenarios (planning a journey, designing a recipe) to test understanding
- Giving vague examples of decomposition: "Breaking a problem down" is not enough — name the specific sub-problems (e.g. "a school system decomposes into: student records, timetabling, attendance, and payments")
This topic summary covers Knowledge Organiser: Computational Thinking within Computational Thinking for GCSE Computer Science. Revise Computational Thinking in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 8 flashcards. This is a high-frequency topic, so it is worth revising until the explanation feels precise and repeatable. It is section 7 of 7 in this topic. Use this topic summary to connect the idea to the wider topic before moving on to questions and flashcards.
Practice questions for Computational Thinking
Which computational thinking technique involves breaking a complex problem into smaller, more manageable sub-problems?
A developer is building a school website. Explain how decomposition could be used to help plan and solve this problem. [3 marks]