Fichas
Algorithms
Fichas del conjunto (19)
- 1Linear SearchA linear search is a simple, sequential search. It starts at the beginning of the list and moves through the items, one by one, until it finds a matching value or reaches the end without finding one.
- 2Binary SearchThe binary search algorithm searches an ordered list to find an item by looking at the middle (median) item and comparing it with the search value
- 3Bubble SortThis algorithm is used to sort an unordered
list by comparing adjacent items.
[adjacent items -items of data that are next to each other] - 4Insertion SortIt is used in an unordered list, it examines each item in turn and inserts it in it correct position. It only has to go through the list once.
- 5Merge SortIt is the fastest out of all the others.
The merge sort algorithm is used to sort an unordered list by repeatedly (recursively) dividing a list into two smaller lists until the size of each list becomes one. This is why it is called a ‘divide and conquer’ algorithm. - 6IterationRepeating
OR
Looping - 7SelectionIf and Else Questions
- 8SequenceA command
- 9ArrayA list
- 10StringAlphabets
- 11IntegerA whole number
- 12Real/Floating numberA decimal number
- 13ANDIf BOTH statement are true then its true
- 14ORIf one or the other statement is true then its true
- 15NOTOpposite of the statement
- 16Binary Addition Rules1 and 0 = 1
0 and 0 = 0
1 and 1 0 (carry 1)
1 and 1 with a carried 1 = 1 (carry 1) - 17OverflowOverflow is when a binary result value is greater than its maximum possibility.
(when it reaches the 9th bit) - 18Binary Shift LEFTSHIFT LEFT makes the '1s and 0s' to move to the left
It multiplies it by 2 - 19Binary Shift RIGHTSHIFT RIGHT makes the '1s and 0s' to move to the right
It divides it by 2
Información
- Descripción
- GCSE Computer Science Fichas sobre Algorithms, creado por Boney Mahesh el 09/01/2017.
- Creado por
- Boney Mahesh
- Visitas
- 3
- Valoración