Algorithm MCQs

1. Which notation describes the upper bound of an algorithm's growth rate?

a)Omega b)Theta c)O d)o

2. What does Theta(g(n)) represent?

a) The upper bound of growth b) The lower bound of growth c) The exact growth rate d) The average growth rate

3. Which notation is used to describe the lower bound of an algorithm's growth rate?

a) O b)Omega c)Theta d)o

4. If f(n) = 5n^2 + 3n + 2 , which of the following is true?

a)f(n) in O(n) b)f(n) in Theta(n^2) c)f(n) in Omega(n^3) d)f(n) in o(n^2)

5. Which of the following is true about O(g(n)) ?

a) It describes the exact growth rate of a function. b) It describes the lower bound of a function's growth rate. c) It describes the upper bound of a function's growth rate. d) It describes the average growth rate of a function.

6. What is the relationship between O, Omega, and Theta ?

a)O is the opposite of Omega . b)Theta is the intersection of O and Omega. c)O is the same as Theta. d)Omega is the same as Theta.

7. Which of the following functions grows faster than n^2 ?

a)nlog n b)n^2 c) n^3 d)log n

8. What is the order of growth of f(n) = 2^n ?

a) Logarithmic b) Linear c) Polynomial d) Exponential

9. Which of the following is true about o(g(n)) ?

a) It describes the upper bound of a function's growth rate. b) It describes the lower bound of a function's growth rate. c) It describes a function that grows strictly slower than \( g(n) \). d) It describes a function that grows at the same rate as \( g(n) \).

10. Which of the following is the correct order of growth from slowest to fastest?

a)log n, n, n^2, 2^n b)n, log n, n^2, 2^n c)log n, n^2, n, 2^n d)n, n^2, log n , 2^n

Asymptotic Notations MCQs

Your Score: /10