Fichas
computing revision
Fichas del conjunto (10)
- 1DecompositionDecomposition means breaking a problem into
a number of sub-problems, so that each subproblem
solves an identifiable task, which
might itself be further subdivided. - 2linear searchLinear search, also known as sequential search, is a process that checks every element in the list sequentially until the desired element is found.
- 3binary searcha sorted array by repeatedly dividing the search interval in half.
- 4merge sortMerge sort is a sorting technique based on divide and conquer technique. With worst-case time complexity being Ο(n log n), it is one of the most respected algorithms
- 5bubble sortBubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order.
- 6ModDivides left hand operand by right hand operand and returns remainder
13 mod 2 = 1 - 7= ≠equal to
not equal to - 8ArrayAn array is a list of items which are all the same datatype under a single identifier
e.g list of numbers, list of names. - 9DivDivides left hand operand by right hand operand
- 10Hexadecimal01011110
(binary)
0101 1110
5 E
5E
(hexamdecimal)
Información
- Descripción
- Year 10 Computing Fichas sobre computing revision, creado por Danny Edgell el 07/03/2017.
- Creado por
- Danny Edgell · mar 2017
- Actualizado
- 28 mar 2017
- Visitas
- 0
- Valoración