Computational Thinking Revision Resource

Computational Thinking Revision Resource

1. Decomposition

   • Definition: Decomposition is where you break a problem down into smaller more manageable parts.
   • We use decomposition to make solving the larger problem easier.
   • An example of decomposition would be if we wanted to know which form group was the tallest. We would draw a diagram and break the larger parts down into smaller bits so that it helps us to solve the bigger picture.

2. Abstraction

   • Abstraction is when we filter through the information to find out what is necessary and what is not.
   • We use abstraction to make sure only the necessary problem is solved.
   • An example of abstraction is the London Underground. We don't need to know the precise geographical locations of each station but we do need to know the which stations are linked to which.

3. Pattern Recognition

   • Pattern Recognition is identifying the repeated elements of the problem and grouping them together.
   • An example would be teliing a robot how to move around a maze. We would use simple instructions but repeat them over and over again until we have solved them.

4. Algorithms

   • An algorithm is a set of step by step instructions that solve a problem.
   • Structured Englsih
     • Short precise sentences to express instructions.
     • Example: Writing out how to bake a cake. The instructions are short precise and to the point to make baking a cake easier.
   • Flowcharts
     • Terminator. This sign is a stretched oval used to signify the start and end of a flowchart.
     • Process. This is a rectangle. The information inside it contains something that happens.