paper 2

paper 2

1. computational thinking

   • decomposition
     • what is it?
       • the breaking down of problems into more smaller steps
         • these new tasks are more simpler
     • top down diagram
       • these diagrams show an easier representation
       • drawn in a tree diagram representation
         • problem represented by big box at the top
           • the sub problems are then represented by smaller boxes branching off of the main problem with sometimes their own sub problems
             • the diagram is complete once all problems have an easy solution to them
     • this can help with tricky problems allowing smaller parts to be analysed in detail
   • pattern recognition
     • many problems are solved by doing things in similar or the same ways repeatedly
       • this is a pattern
         • in computer programs patterns could involve loops, subroutines, code libraries and creating classes
     • patterns can be recognized by comparing two different decomposed problems and seeing what similarities they have
       • we can give these partterns names when we take out the differences
         • then we can replace the differences with a variable
           • e.g.
             • how long something takes could be called time
             • or if what we are using is different replace it with item
   • abstraction
     • this is removing all unnecessary details
       • e.g. on a map of london there is too much detail for us to be able to see the map of the underground
         • however if we just get a map of the underground its much easier to see what we need to do
     • this can be extremely useful for being able to easily see whats needed to do and can save loads of time
   • algorithmic thinking