Algorithms 2.0

Algorithms 2.0

1. Computational Thinking - Key terms

   • gggg
   • algorithm:a process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer
     • decompose:Breaking down a large problem into smaller sub-problems
       • sequence:Completing steps in the order which they must happen
   • selection:Where a choice is made in a program depending on a condition or outcome

2. Flowcharts

   • Displays an algorithm in diagram form using symbols and arrows to show to flow of information
   • a diagram of the sequence of movements or actions of people or things involved in a complex system or activity

3. Abstraction

   • Abstraction is a computational thinking technique that simplifies a problem by removing unnecessary detail so that you can focus on the important parts that are relevant to the problem.
   • The London Underground map is a classic example of abstraction.

Images and files in the map