Mind map
2.1 algorythms
Map content
2.1 algorythms
computational thinking
- its a way of understanding complex problems
- decomposistion
- breaking the problem down into smaller pieces
- abstraction
- removing details that are not relevent to solving the problem
- algorythmic thinking
- identifying logical steps from the problem to the solution to produce a reusable algorythm
- examples of abstraction
- the london underground map is a classic example of abstraction
- it focuses on the important details such as stations names and the routes from one to another along the various train lines
- the lines are not realistically representitive of the actual paths taken by each train
- a map represents something from the real world
- it removes unnesercery details (plants,trees,coulor of houses anything not important
- icons in a WIMP GUI are examples of abstractrions
- icons in a WIMP GUI are examples of abstractrions
- it removes unnesercery details (plants,trees,coulor of houses anything not important
- a map represents something from the real world
- the lines are not realistically representitive of the actual paths taken by each train
- it focuses on the important details such as stations names and the routes from one to another along the various train lines
- the london underground map is a classic example of abstraction
- examples of abstraction
- identifying logical steps from the problem to the solution to produce a reusable algorythm
- algorythmic thinking
- removing details that are not relevent to solving the problem
- abstraction
- breaking the problem down into smaller pieces
- decomposistion
- its a way of understanding complex problems
Information
- Description
- Mind Map on 2.1 algorythms, created by Daniel Reed on 15/02/2019.
- Created by
- Daniel Reed
- Views
- 3
- Rating