Computing

Computing

1. Searching algorithms

   • Linear search
     • A method of searching for a particular item which involves starting at the start of the list and checking if the current value is the one being searched for and moving to the next value and etcetera.
   • Binary search
     • A method of searching for a value which involves finding the middle value and checking if it is the desired value and if not, checking which side of it includes the desired value being searched for.
       • Only works if all values are in order, if not it might have to be sorted.
   • Algorithms
     • An algorithm is a set of instructions describing how something is done.
       • Can be displayed through psuedocode, flowcharts and code.
       • Written using statements and expressions
   • Sorting algorithms
     • Merge sort
       • All items are split into individuals from the list, then they are paired up and ordered with their pair. They then pair up with another pair and order themselves; this keeps repeating till all items are together and in order.
     • Insert sort
       • Same as bubble sort but after two the values are swapped, the one that was swapped carries on comparing itself to the one before it until ends up as far as it can go back. The process then repeats until everything is in order.
     • Bubble sort
       • The last ordered value is compared with the one after it. If it is swapped, the next value is compared with the next value and etcetera. If it's not swapped it will go to the next unsorted value and then compared with the next value.

2. Logic gates

   • Not = ¬ And = ^ Or = v
   • Truth tables
     • Number of rows on a truth table = 2^n n = number of inputs

Imagens e arquivos do mapa