1. . The main measure of the efficiency of the algorithm
(A) Process and memory
(B) Time and space
(C) Date and space
(D) Complexity and capacity
2. . Big-oh allows the possibility the growth rates are the
(A) Different
(B) Same
(C) Greater
(D) None of these
3. . Which symbol tells us logarithms grow very slowly?
(A) logkN = O(N)
(B) Log(N)
(C) Log₂(N)
(D) Nlog(N)
4. . The relative growth rates of two functions f(N) and g(N) by limₙ→0 f(N)/g(N) then
(A) f(N) = o(g(N))
(B) f(N) + o(g(N))
(C) g(N) = o(f(N))
Answer: (C) g(N) = o(f(N))
5. . Gcf()
(A) Greater common divisor
(B) Greatest common divisor
(C) Greatest common divior
(D) None of above
6. . If M > N then M mod N
(A) N < M/2
(B) N ≥ M/2
(C) N ≤ M/2
M/2″ onclick=”checkAnswer(‘q6’, ‘N < M/2')"> (D) N > M/2
7. . An online algorithm that runs in
(A) Binary search
(B) Fraction time
(C) Bubble search
(D) Linear search
8. . In maximum subsequence, the input size is N = 100,000 then O(N³)
(A) 3.33
(B) 86.67
(C) N/A
(D) 0.03332
9. . N² symbol is
(A) Quadratic
(B) Cubic
(C) Linear
(D) Constant
10. . log₂N symbol is
(A) Logarithm
(B) Long-square
(C) Exponent
(D) Linear
11. . Euclid’s algorithm is used for computing the
(A) The complexity of bubble sort
(B) Time complexity
(C) Common divisor
(D) The complexity of the binary search
12. . The complexity of linear search algorithm
(A) C(n)
(B) O(log n)
(C) O(n²)
(D) O(n log n)
13. . The complexity of bubble sort algorithm
(A) O(n)
(B) O(log n)
(C) O(n)
(D) O(n log n)
14. . The complexity of merge sort algorithm
(A) O(n)
(B) O(log n)
(C) O(n²)
(D) O(n log n)
15. . Which of the following case does not exist in complexity theory?
(A) Best case
(B) Worst case
(C) Average case
(D) Null case
