7.1 Computational thinking Flashcards

1
Q

Abstraction

A

Abstraction is the process of removing unnecessary details of a problem to focus on the important features to implement in a solution.
Examples of abstraction include modelling a real-life object, environment, action, sequence of actions or concept.
Implementations of these include:
Computer game that simulates playing a sport.
Simulator such as a car or ight simulator.
Map of a bus or train route in a city.
When creating a program, developers must identify important features that will contribute to solving the problem or have a role to play in the solution.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Decomposition

A

Decomposition is the process of breaking down a large problem into a set of smaller problems.
Bene ts of decomposition are:
Smaller problems are easier to solve.
Each smaller problem can be solved independently of the others.
Smaller problems can be tested independently.
Smaller problems can be combined to produce a solution to the full problem.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Algorithmic thinking

A

Algorithmic thinking is the process of creating step-by-step instructions in order to produce a solution to a problem.
Algorithmic thinking requires the use of abstraction and decomposition to identify each individual step.
Once each step has been identified, a precise set of rules (algorithm) can
be created and the problem will be solved.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly