The big idea: Computational thinking is a set of techniques for making a hard problem solvable.
Break it up, spot what repeats, ignore what does not matter, and write down the steps. None of it requires a computer.
One example throughout: Organising a school sports day: hundreds of students, dozens of events, a fixed number of tracks and one afternoon.
Each concept below is that same problem, handled a different way.
Free preview
This is the free notes preview
You're reading the free notes. Aimnova Pro unlocks the full study experience — and you can try it with your first topic free to keep:
- FlashcardsLock in vocabulary and key terms with spaced repetition.
- Practice questionsAnswer exam-style questions and get instant AI marking.
- Mock exams & past-paper vaultSit full mocks and see exactly how examiners award marks.
- Personalised study planA daily plan built around your exam date and weak areas.
Start Studying Free Full access to Aimnova Pro · cancel anytime
1
Decomposition — break it up
2
Pattern recognition — spot what repeats
3
Abstraction — ignore what does not matter
4
Algorithmic design — write the steps
Abstraction is the one people get wrong: It does not mean being vague. It means deciding what to leave out, deliberately and for a reason.
A map leaves out the colour of every house. That is not carelessness; it is what makes the map usable.
Get feedback like a real examiner
Submit your answers and get instant feedback — what you did well, what's missing, and exactly what to write to score full marks.
Try AI Tutor FreeYour first topic is free to keep • No credit card required
In that order, usually
- Decompose first, so you have pieces small enough to hold in your head
- Recognise patterns across the pieces, so one solution covers several
- Abstract each piece to just what it needs
- Design the algorithm for each piece, then join them up
But not rigidly
- Spotting a pattern often suggests a better decomposition
- Writing the algorithm reveals detail you abstracted away too soon
- Real work loops back through the four several times
- The order is a starting point, not a procedure
No programming required: The guide is explicit: computational thinking does not necessarily involve programming.
It is how a problem is approached. Planning a sports day, designing a database or diagnosing a fault all use the same four techniques.
How this is tested — you must name the concept AND show it being applied to the scenario in front of you. It comes up two ways:
Paper 2 — working with code
- Describe the four concepts, 3-4 marks
- Identify which concept a described action uses
- Apply one concept to a stated problem
Paper 2 — the algorithmic-thinking question
- Apply the concepts to a problem given in words
- Explain how they make it solvable — no code needed
The classic trap: Defining abstraction as "simplifying". It is deciding what to leave out, and why. An answer that names what was dropped and what was kept earns the mark; "making it simpler" does not.
IB-style questionDescribe[4 marks]
A supermarket wants a system to reorder stock automatically. Describe how each concept of computational thinking would be applied.
Model answer plan
See the mark-by-mark plan — for / against / judgement, with marking guidance — in study mode.