COMPUTATIONAL THINKING
Computational Thinking (CT) is the
thought processes involved in formulating a problem and expressing its
solution(s) in such a way that a computer—human or machine—can effectively
carry out. Computational Thinking is an iterative process based on three
stages: 1) Problem Formulation (abstraction), 2) Solution Expression
(automation), and 3) Solution Execution & Evaluation (analyses) captured by
the figure to the right. The term computational thinking was first used by
Seymour Papert in 1980 and again in 1996. Computational thinking can be used to
algorithmically solve complicated problems of scale, and is often used to
realize large improvements in efficiency.
ALGORITHM THINKING
Algorithmic thinking is a way of
getting to a solution through the clear definition of the steps needed –
nothing happens by magic. Rather than coming up with a single answer to a
problem, like 42, pupils develop algorithms. They are instructions or rules
that if followed precisely (whether by a person or a computer) leads to answers
to both the original and similar problems. For example, we all learn algorithms
for doing multiplication at school. If we (or a computer) follow the rules we
were taught precisely we can get the answer to any multiplication problem. Once
we have the algorithm we don’t have to work out how to do multiplication from
scratch every time we are faced with a new problem.
No comments:
Post a Comment