WorksheetsCSF U2 Algorithms p1
Total questions: 10
Worksheet time: 7mins
Algorithms must
be step by step
be correct
be doable
be precisise
Algorithms are NOT analyzed for
correctness
efficiency
speed on a computer
clarity
Binary is a number system where
the column values go up by a factor of 2
has two symbols - 0 and 1
can only represent certain numbers
is the simplest number system
How bits are in a byte?
4
8
16
32
The binary number 10110 in decimal is
(a)
The Octal number 22 in decimal is
(a)
Convert the Hexadecimal number 02B3 to binary number with 16 bits
(a)
If you use Linear search to find something in a set of 10 items and do NOT find it, it will take
5 comparisons
it depends on the data
10 comparisons
8 comparisons
In which search algorithm below MUST the data be sorted?
Linear Search
Binary Search
Hashing
Which sort algorithm is considered O(n2) efficient?
Selection
Quicksort
Mergesort
