Scribd
Upload
17 views1 page

Computational Thinking

Computational thinking involves the processes of formulating problems and solutions for information-processing agents. Key tools include pattern recognition, abstraction, decomposition, and algorithm-making, each serving to simplify problem-solving. Algorithms must be finite, definite, effective, and have defined inputs and outputs.

Uploaded by

Kenji Abanto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views1 page

Computational Thinking

Computational thinking involves the processes of formulating problems and solutions for information-processing agents. Key tools include pattern recognition, abstraction, decomposition, and algorithm-making, each serving to simplify problem-solving. Algorithms must be finite, definite, effective, and have defined inputs and outputs.

Uploaded by

Kenji Abanto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

● Computational thinking pertains to the thought processes involved in formulating

problems and their solutions so that the solutions are represented in a form that can be
effectively carried out by an information-processing agent
● Different computational thinking tools are:
○ Pattern Recognition - recognizing the essential and non-essential information to
determine what is needed to solve a problem
○ Abstraction - breaking down a problem into smaller, simpler, and manageable
chunks
○ Decomposition - observing patterns in a problem that is repeated again and
again
○ Algorithm-making - a finite step-by-step sequence of instructions intended to
solve a problem
● Properties of an algorithm:
○ Finite - The algorithm has a clear end
○ Definite - There is a clear order of steps in which way a step will go
○ Effective - Each step can be finished within a finite time
○ Input - Requirements needed to solve a problem, an algorithm can have 0 or
more inputs
○ Output - Result of an algorithm, at least 1 output is needed

You might also like