Karteikarten
Unit 2.1 - Algorithms
Karten in diesem Stapel (13)
- 1AbstractionRemoving unnecessary elements and using symbols, variables etc. to represent a 'real world' problem
- 2Computational ThinkingThe use of computers to solve problems and the development of algorithms to solve problems as well as using abstraction, decomposition and algorithmic thinking
- 3DecompositionThe breaking down of larger problems into smaller problems
- 4Why are smaller problems more efficient to solve?-They're easier to solve
-They are independent to other problems
-They can be tested individually
-They combine to produce the full problem - 5Linear SearchEach item in the list is checked in order. Used when information is not in order
- 6Binary SearchThe list must be in order.
Take the middle value; compare to the value you're looking for' if it's larger/smaller then take the values to the left/right of the middle value and repeat until found - 7Bubble SortMoving through a list repeatedly, swapping elements in the wrong order. If element 1 is larger than element 2 then swap them and continue/repeat until you've made no changes
- 8Merge SortA list is split into individual lists, these are then combined two lists at a time. Compare the first element in both lists and put the smallest into a new list
- 9Insertion SortEach item is taken in turn, compare to the items in a sorted list and place in the correct position. First item is a 'sorted list' so take the next item and order it according to its size and repeat
- 10AlgorithmThe series of steps to solve a problem or perform an action
- 11Dry RunWalking through an algorithm which samples data, running through each step manually
- 12Trace TableA table which follows the values of variables to check for accuracy
- 13Correcting Algorithms1) Read what the algorithm needs to do at least twice
2) Draft the steps that should take place
3) Read through each step of the algorithm
4) Compare what the algorithm does compared to what it's supposed to do
Informationen
- Beschreibung
- Karteikarten am Unit 2.1 - Algorithms, erstellt von Karolina Rawdanowicz am 10/01/2019.
- Erstellt von
- Karolina Rawdanowicz
- Aufrufe
- 14
- Bewertung