Notes

2.1
- Abstraction is where it only shows important things such as a map. It will print out the important things and leave the other things such as tress out.
- Decomposition is breaking down something complex.
- Algorithmic thinking is inserting a set of rules e.g. how to brush your teeth
2.2
- Flow chart is a table from start to finish e.g. start--input number 1--is number 1 greater than 5--no--yes etc
- pseudocode is the same as a flow chart but it is put in a python code
- structure diagrams is to break down a chart into the main tasks e.g. input employee details, calculate pay and produce pay slips. This would go into the next level of the chart.
- Identify common errors is where you will identify what you have done wrong in your python code and change it so it works.
- Trace tables are involved in running a program to see if it works. This is an excellent way to trach down any logic errors.
2.3
- A binary search is to find the midpoint in the data set.
- A linear search is starting form the beginning of a data set, each item is checked in turn to see if it is the one being searched for.
- Bubble sort is to compare each item in the data set and put them in order.
- A merge sort is to split up a data set into separate squares and then begin to combine them together in order.
- Insertion sort is to put the data into alphabetical order showing the lowest one at the bottom.
2.4
- Truth tables is a set of logic gates such as AND, OR and NOT. A NOT gate shows only 1 input and 1 output. The gate does the opposite such as turning it on will turn it off and turning it off will turn it on. An AND gate has 2 inputs and 1 output. It will turn the light on when both of the inputs are turned on. If one or both are turned off, then the light will not appear to be on. Lastly an OR gate has 2 inputs and 1 output. When 1 or both switches are turned on, the light will turn on . When they are both turned off, the light will not be turned on.