Computational thinking involves breaking down problems into simpler steps for computers to solve (decomposition), recognizing patterns across problems, focusing on essential problem details (abstraction), and developing step-by-step instructions known as algorithms. The four main pillars of computational thinking are decomposition, pattern recognition, abstraction, and algorithm design. Algorithm design uses basic building blocks like sequence, selection, and iteration to create efficient step-by-step solutions to problems.

1. Computationa
l Thinking
MAYA P GURAV

2. What is computational thinking?
It’s the process of breaking down a
problem into simple enough steps that a
a computer would understand.

3. Four Pillars of
Computational
Thinking
DECOMPOSITION
PATTERN RECOGNITION
ABSTRACTION
ALGORITHM DESIGN

5. Decomposition
The power of Computational Thinking starts with decomposition, which is the
process of breaking down complex problems into smaller, more manageable
parts.
With decomposition, problems that seem overwhelming at first become much
much more manageable.
“If you can’t solve a problem, then there is an easier problem you can solve: find it.” George
Pólya
Take Problems
Apart

8. Pattern Recognition
Pattern recognition is all about recognizing patterns, looking for similarities
among and within problems.
“Pattern recognition is the art of seeing the invisible connections between seemingly unrelated
things.
Look for
Similarities

11. Abstraction
Abstraction in computational thinking is the art of simplification, where
complex problems are distilled into essential components, enabling efficient
problem-solving and the creation of powerful solutions.
“But it is a pipe." "No, it's not," I said. It's a drawing of a pipe. Get it? All representations of a thing
are inherently abstract. It's very clever.”
Focus on what’s
important

14. Algorithm Design
An algorithm is a process or formula for calculating answers, sorting data, and
automating tasks; and algorithmic thinking is the process for developing an
algorithm.
“It's a step-by-step plan that helps the computer know exactly what to do, making
complex tasks easier and faster to accomplish. Just like a recipe.
Create Step by
Step Instructions

17. • Sequence
• Selection
• Iteration
Basic Building
Blocks
Algorithm Design

18. SELECTION
•IF represents the question
•ELSE points to what to do if the answer to the
question is false
Example :
•Ask how old you are
•IF you are 70 or older, say “You are Senior
Citizen”
•ELSE say “You are not a Senior Citizen!”

19. ITERATION
Why is iteration important?
Iteration allows us to simplify our algorithm by stating
that we will repeat certain steps until told otherwise.
For example, a very simple algorithm for eating
breakfast cereal might consist of these steps:
put cereal in bowl
add milk to cereal
spoon cereal and milk into mouth
repeat step 3 until all cereal and milk is eaten
rinse bowl and spoon

24. Bibliography
https://www.bbc.co.uk/bitesize/guides/zp92mp3/revision/1
https://equip.learning.com/decomposition-computational-
thinking/
https://www.geeksforgeeks.org/fundamentals-of-algorithms/