Imagine you're planning a birthday party. Decomposition is breaking it into smaller tasks: venue, food, invites, decorations. Abstraction is focusing on what matters (who's coming) and ignoring details (what colour their socks are). Pattern recognition is noticing every party needs a cake. Algorithmic thinking is creating step-by-step instructions for the DJ. These four skills help solve ANY problem - not just computing ones!
This introduction covers Thinking Like a Computer Scientist 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 2 of 7 in this topic. Use this introduction 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]