Unit 1

Unit 1

1. Computational thinking

   • Algorithms
     • A step by step set of instructions followed in order to complete a task
   • Decomposition
     • Breaking down the algorithm into smaller, more manageable sections
   • Abstraction
     • Removing irrelevant information to make the algorithm better fit for the task
   • Pattern recognition
     • Recognising patterns in data

2. Algorithms

   • Flowcharts
     • A visual representation of algorithms using pictures and shapes.
     • Shapes
   • Pseudocode
     • A written representation of algorithms.
     • Operations
       • MOD
         • the remainder after dividing two numbers by each other. written as % in python
       • DIV
         • Divide- how many times a number goes into another a number- the answer must be an integer.
       • +, -, *,
     • Programming languages
       • Data types
         • Constrains the type of value that is stored in a variable.
         • Integers
         • Boolean
         • Sequence
           • An IF statement is a selection statement.
         • Float
         • String
         • Characters
   • Variables
     • A storage location that holds data that can change 
     • Integers
     • String
     • Characters
     • Boolean

3. Searching algorithms

   • Bubble sort
     • In a list of n numbers, n^2 comparisons will need to be made
       • This is slow and inefficient for more than a few items.
     • Compare the first and second element from the list.
       • If first number is more than second number, swap them.
         • If not, go to second number and repeat.
   • Linear search
   • Merge sort
     • This method is fast but includes many steps to uses more memory space
     • The elements are split into individual lists.
       • The first elements in each list are compared
         • The smallest is put into a new list
           • Repeat until merged
   • Binary search

Images and files in the map