16414039
Description
Computer
Science
- 2.1 Algorithms
- Computational Thinking
- There are four elements of computational thinking, they are:
- Decomposition
- Simple tasks have simple solutions. You can
break large problems that are complex into
several smaller simpler tasks, this is known as
decomposition
- For example you have been tasked with
creating a game and you have broke it down
into smaller tasks
- What type of game is it going to be?
- What is the style of the game?
- Who is the audience of the game?
- Does it have challenge and
what are the rewards?
- How does the game end?
- What is the name of the game?
- What type of game is it going to be?
- This is what decomposition
is about, defining the
problem in more detail and
making it easier to solve
- For example you have been tasked with
creating a game and you have broke it down
into smaller tasks
- Simple tasks have simple solutions. You can
break large problems that are complex into
several smaller simpler tasks, this is known as
decomposition
- Pattern Recognition
- Abstraction
- Removing unnessisary information is called abstraction.
- Only leaves the data that is required
- For example a designer needs to make a T Junction sign
- The sign must follow certain rules:
- Must take no more that 1 second for a driver to look at it and understand its meaning
- Must take no more that 1 second for a driver to look at it and understand its meaning
- The sign must follow certain rules:
- The first attempt is shown to the right and as you can see
it is very cluttered and will take more than a second for a
driver to recognise the sign
- It also doesn't follow the
rules for the shape and
colour
- It also doesn't follow the
rules for the shape and
colour
- The second attempt is shown to the right and as you can see it is less
cluttered than version 1, however it still breaks the rules as it says that
there must not be any words
- It also doesn't follow the
rules for the colour
- It also doesn't follow the
rules for the colour
- The third and final attempt follows all the rules, the
shape, the colour and doesn't contain any words
- Also any unessisary clutter has
been removed
- Also any unessisary clutter has
been removed
- Removing unnessisary information is called abstraction.
- Algorithmic Thinking
- There are 2 popular methods to set out an algorithm:
- Pseudocode - Text
statements written for
each step of the
algorithm
- Flow chart - This uses a set of
standart shapes and arrows
(Shown to the right-->) tO make
a diagram of the algorithm
- Pseudocode - Text
statements written for
each step of the
algorithm
- Algorithms often include a decisaion to be made
at some point in the task. In order to handle this,
a conditional statement is used.
- There are 2 popular methods to set out an algorithm:
- Decomposition
- There are four elements of computational thinking, they are:
- Computational Thinking
Want to create your own Mind Maps for free with GoConqr? Learn more.