Computationa

l Thinking
Part 1
What is
Computational
Thinking?
Computers can be used to help us solve
problems. However, before a problem
can be tackled, the problem itself and
the ways in which it could be solved
need to be understood.
Computational thinking allows us to
take a complex problem,
understand what the problem is and
develop possible solutions.
We can then present these solutions in a
way that a computer, a human, or
both, can understand.
It's not just about programming; it's a
way of approaching problems
systematically.
 Aspect Scientific Method Design Thinking Computational Thinking
To solve problems
To discover new knowledge To find innovative solutions
Goal systematically using
and understanding to problems
computational tools
Empirical observation and Empathy and understanding Breaking down complex
Focus
experimentation of user needs problems into smaller parts
Widely used in product Applicable in various domains,
Used primarily in scientific
Application design, innovation, and including computer science,
research and experimentation
problem-solving engineering, and business
Conducting experiments to Designing a new user-friendly Writing code to automate a
Example
test a hypothesis smartphone repetitive task

Problem Solving Approach

Computational
thinking
challenge
How can we efficiently calculate the
sum of all numbers from 1 to 200?
Key Components:
DECOMPOSITI
ON
Breaking down a complex
problem into smaller, more
manageable parts or sub-
problems. By breaking the
problem into smaller chunks, it
becomes easier to analyze and
solve. Decomposition allows
us to focus on solving each
smaller part individually,
leading to a more efficient
problem-solving process.
Key Components: DECOMPOSITION
Image Processing Game Development Network Security

Image preprocessing, feature Designing game mechanics, Analyzing network traffic logs,
creating game levels, identifying suspicious activity
extraction, object classification, implementing user interfaces, and patterns, and assessing
and bounding box detection. optimizing performance. vulnerabilities in network
infrastructure.
Key Components:
Pattern Recognitio
n
Pattern recognition involves
identifying similarities,
trends, or recurring elements
within data or problems.
Recognizing patterns helps in und
erstanding the underlying structure
of a problem and can
lead to more efficient solutions.
Patterns can exist in various
forms, such as
numerical sequences,
visual representations, or logical re
lationships.
Key Components: PATTERN
RECOGNITION Medical Diagnosis
Speech Recognition
Algorithms analyze audio input Machine learning algorithms
to recognize phonetic analyze large datasets of
patterns, words, and sentences. patient information to
recognize patterns
By identifying recurring patterns such as symptoms, medical history,
in speech signals, the system
can accurately transcribe spoken and diagnostic test results.
words into text. associated with specific diseases
or medical conditions.
Key
Components:
Abstraction
Abstraction involves focusing on
the essential details of a problem
while ignoring irrelevant or extran
eous information. It allows us to
simplify complex problems by gen
eralizing them into broader
concepts or models.
Abstraction helps in managing co
mplexity and enables us to create
more scalable and reusable solutio
ns.
Key Components: ABSTRACTION
Get dressed in the morning
You’re able to quickly evaluate wardrobe needs
and put together a corresponding outfit relatively
simply.
You have previous knowledge about which
patterns and colors match without reanalyzing
color science each time you get dressed,
efficiently narrowing down your blouse or shoe
selection.
Finally, you also use abstraction to effectively
pair a sweater and jeans as opposed to a sweater
and running shorts instead of analyzing every
possible clothing combination every time you get
dressed.
Key Components:
Algorithm
Thinking
Algorithmic thinking involves desi
gning step-by-
step procedures or algorithms to so
lve problems systematically. It req
uires identifying and organizing th
e necessary steps to achieve a spec
ific goal efficiently. Algorithms ca
n
be thought of as recipes or instruct
ions that guide the solution to a pr
oblem, ensuring consistency and r
eproducibility.
Key Components: ALGORITHM
THINKING
Product Recommendation Algorithm
Algorithmic thinking involves designing step-
by-step procedures or algorithms to solve
problems systematically.
It requires identifying and organizing the
necessary steps to achieve a specific goal effici
ently.
Algorithms can be thought
of as recipes or instructions that guide the solut
ion to a problem, ensuring consistency and repr
oducibility.
Key Components: ALGORITHM
THINKING
Computationa
l Thinking
Part 2
Understanding the
Foundations of Problem
Solving
What is an
Algorithm?
An algorithm is a precise set of
instructions guiding a computer
through the execution of a task.
It constitutes a finite sequence of
steps arranged in a specific order,
designed to achieve an objective.
Each step specifies a
particular action or calculation to
be performed, often based on the a
lgorithm's logic and requirements.
What is a Flowchart?
A flowchart is a visual representation of an algorithm,
typically using symbols and arrows to depict the sequence of
steps and decisions involved in completing a task.
Flowcharts are used in various fields, including
programming, engineering, business, and education, to
illustrate complex processes in a clear and structured
manner.
They help in understanding, analyzing, and communicating
the flow of information and operations within a system or
procedure.
Basic Shapes of a Flowchart
Flowcharts consist of a few common geometric shapes representing steps.

Start/End Symbol
The terminator symbol marks the starting or ending
point of the system. It usually contains the word
"Start" or "End."
Basic Shapes of a Flowchart
Flowcharts consist of a few common geometric shapes representing steps.

Decision Symbol
A decision or branching point. Lines representing
different decisions emerge from different points of
the diamond.
Basic Shapes of a Flowchart
Flowcharts consist of a few common geometric shapes representing steps.

Action or Process Symbol

A box can represent a single step ("add two cups of
flour"), or an entire sub-process ("make bread")
within a larger process.
Basic Shapes of a Flowchart
Flowcharts consist of a few common geometric shapes representing steps.

Input/Output Symbol
Represents material or information entering or
leaving the system, such as customer order (input) or
a product (output).
Basic elements of an algorithm
Control Structures
In algorithm design, control structures are
fundamental constructs that dictate the flow of
execution within an algorithm.
They allow algorithms to make decisions, iterate
through data, handle errors, and control the overall
sequence of operations. Here's an explanation of
control structures in the context of algorithm design:
Control Structures: Conditional Statements
Conditional statements enable algorithms to
execute different sets of instructions based on
specified conditions.
For example, an algorithm might use an if
statement to check if a certain condition is true,
and then execute one set of instructions if the
condition is met, or another set of instructions if it
is not.
Conditional statements are crucial for
implementing decision-making logic in
algorithms.
Practice 1: Conditional Statements
Create an algorithm with two conditional statements using if-else structures. Define
conditions, specify actions accordingly, test with varied inputs, refine, and document.
Collaborate with peers for clarity and effectiveness.
Practice 2: Conditional Statements
1. Draw a flowchart to find bigger number among two numbers
2. Draw a flowchart to check if a number is positive or not
 Practice 2: Conditional Statements
START START

Input A, Input A
B
NO YES
A>
NO IS YES 0
A>
B NO YES Print "Positive
A ==
Number"
Print "B 0
Print "A
is is
Bigger" Bigger" Print "Positive
Number" Print "Zeror"

STOP

STOP
Control Structures: LOOPS
Loops allow algorithms to repeat a set of instructions
multiple times, either for a specified number of
iterations or until a certain condition is met.
For example, a for loop can be used to iterate through
a collection of data and perform a particular
operation on each item, while a while loop can
continue executing a block of code as long as a
specific condition remains true.
Loops are essential for tasks that involve iterating
over data or performing repetitive operations.
Control Structures: LOOPS
For Loop While Loop
There are two types of
repetition loops in flowcharts,
i.e., "for loop" and "while
loop."
• for loop is concerned, it
keeps repeating the process
until the last value in the
range is used.
• while loop executes the
statement as long as a
condition is met.
Practice: Loops
1. Design an algorithm to brew tea, ensuring that the water reaches a boiling tempera
ture before brewing begins.
o Check if the water temperature is below the boiling point (100°C).
o If the water temperature is below the boiling point, continue heating until it
reaches the boiling point.
o Once the water reaches the boiling point, proceed with brewing the tea.
Practice: Loops
1. Design an algorithm to brew tea, ensuring t
hat the water reaches a boiling temperature
before brewing begins.
o Check if the water temperature is below
the boiling point (100°C).
o If the water temperature is below the
boiling point, continue heating until it
reaches the boiling point.
o Once the water reaches the boiling
point, proceed with brewing the tea.