- Home
- /
- CS Thinking
- /
- Concept Map
- /
- Computational Thinking
Computational Thinking Concepts
7 concepts · Grades 3-5, 6-8, 9-12 · 2 prerequisite connections
Concept Dependency Graph
Concepts flow left to right, from foundational to advanced. Hover to highlight connections. Click any concept to learn more.
Connected Families
Computational Thinking concepts have 10 connections to other families.
How Computational Thinking Connects to Other Topics
Computational Thinking concepts build on and feed into concepts across other families. Understanding these connections helps you plan what to study before and after.
Builds on
Leads to
All Computational Thinking Concepts
Algorithm
A step-by-step set of instructions for solving a problem or accomplishing a specific task. An algorithm must be precise (every step is unambiguous), finite (it terminates after a bounded number of steps), and effective (each step can actually be carried out).
"An algorithm is like a recipe written for a robot cook: every amount is measured, every step is spelled out, and the last step says stop. A person can guess what 'a pinch' means; the robot cannot, so nothing is left to guess. Unlike most recipes, a good algorithm must also work for every input it is allowed to get, not just one."
Why it matters: Once you can write an algorithm, you can hand a job to a computer or to another person and trust the result, even for inputs you never tried yourself. Steps like 'add a little' or 'keep going until it looks right' fail, because a computer cannot guess what you meant, and steps that never end never give an answer at all.
Decomposition
Breaking a complex problem into smaller, independently-solvable parts that combine into a complete solution.
"Decomposition is how a pizza shop handles a big order: one person makes the dough, one adds sauce and toppings, one runs the oven, and one boxes the pizzas. Each job can be done well by itself, and the jobs fit together at the end. If the jobs get too tiny, like one person per topping, passing the pizza around takes longer than making it."
Why it matters: Decomposition makes big jobs doable and lets several people work at once: one friend makes the invitations while another bakes the cake. It also makes mistakes easier to find, because you can test each small part by itself. Without it, people stare at a huge task, forget pieces of it, or split it so badly that the parts cannot be joined.
Pattern Recognition
Pattern recognition is the process of identifying similarities, trends, or regularities across data or problems in order to build general solutions. By spotting what is the same across different cases, you can create reusable strategies instead of solving each case from scratch.
"Pattern recognition is like a detective comparing several crime scenes: the rooms and times are different, but the same muddy boot print shows up every time, so it points to one culprit. Like a good detective, check the next scene before you are sure, because a clue that matched three times can still be a coincidence."
Why it matters: A pattern lets you solve a hundred cases with one rule: once you see that each table added to a row seats 2 more people, you can plan seats for any number of tables without drawing them. Patterns also power spam filters and face unlock on phones. The danger is trusting a pattern built from too few examples; a rule that fits three cases can still break on the fourth.
Abstraction
Focusing only on the essential information needed to solve a problem while ignoring irrelevant details. Abstraction reduces complexity by creating simplified models that capture what matters and hide what does not, enabling reasoning at higher levels.
"Abstraction is like packing your school bag for one day. You check the timetable and pack only what today's lessons need, leaving the rest at home. Pack too little and your maths book is missing; pack everything and the bag is too heavy to carry. A different day, like a different question, means packing differently."
Why it matters: Abstraction lets you solve hard problems without drowning in detail: a bus route map fits on one page, and a game can treat every enemy as just a position and a speed. Leave out the wrong detail, though, and the answer breaks, like a map that forgets a closed bridge. Keep everything, and the problem stays as messy as it was.
Generalization
Generalization is the process of taking a pattern that appears in several examples and turning it into a rule or method that works in many cases. In computational thinking, it helps students move from one solved example to a reusable strategy.
"Generalizing is like writing a recipe after making pancakes a few times. At first you just cook. After a few batches you notice the same steps each time and write them down with a blank: 'for each person, use 1 egg.' Now anyone can cook for any number of people. A recipe can still fail for a case nobody tried, like cooking for 100."
Why it matters: A rule lets you answer questions you have never seen. Once you know chairs = rows × 4, you can find the chairs for 25 rows without counting them. In coding, one function with a variable replaces dozens of copied lines. A rule made too fast can be wrong, though, so you test it on new examples and say when it works.
Logical Operators
Operators that combine or modify boolean expressions: AND (true only when both operands are true), OR (true when at least one operand is true), and NOT (reverses a boolean value from true to false or vice versa).
"Two light switches wired one after the other light the bulb only when both are on: that is AND. Wired side by side, either switch alone lights it: that is OR. NOT is a switch mounted upside down. The picture predicts every two-input case, but it says nothing about the order a program follows in a long mix of operators."
Why it matters: Most real rules have more than one part: 'age 13 or older and has parent permission', 'free shipping for members or orders over \$50'. Logical operators let a program state such rules exactly. Choose the wrong one and the program still runs but quietly does the wrong thing: AND where you meant OR lets almost nobody through, and OR where you meant AND lets almost everyone in.
Truth Tables
A table listing every combination of boolean inputs and the resulting output for a logical expression.
"A truth table is like trying every setting of a lock whose wheels each have only two positions. Three wheels give 8 settings, few enough to try them all and know for certain which ones open it. The picture also shows why the method stops being practical: 30 wheels would mean more than a billion settings."
Why it matters: A truth table turns 'I think these two conditions do the same thing' into a check you can finish. Engineers use one to specify a logic gate before building it, and programmers use one to simplify a tangled if-statement safely. Without it, people test the two or three cases they happen to think of, and the bug waits in a row they never wrote down.