quiz

Asymptotic Notations

1. Which asymptotic notation represents an algorithm’s worst-case time complexity?

  • A) Theta(Θ)
  • B) Omega(Ω)
  • C) Big O(O)
  • D) Lowercase theta(𝜃)
C) Big O (O) Explanation

2. What does the notation f(x)=o(g(x)) mean as x approaches infinity?

  • A) f(x) is bounded by a constant multiple of g(x)
  • B) g(x) grows much faster than f(x)
  • C) f(x) grows faster than g(x)
  • D) f(x) is equivalent to g(x)
B) g(x) grows much faster than f(x) Explanation

3. Which notation denotes the upper and lower boundaries of an algorithm’s time complexity?

  • A) Omega (Ω)
  • B) Theta (Θ)
  • C) O (Big O)
  • D) O (Little O)
B) Theta (Θ). Explanation

4. What does amortized efficiency measure in algorithm analysis?

  • A) The worst-case time complexity of an algorithm.
  • B) The average-case time complexity of an algorithm.
  • C) The overall performance of an algorithm over a sequence of operations.
  • D) The best-case time complexity of an algorithm.
C) The overall performance of an algorithm over a sequence of operations. Explanation

5. What is the basic asymptotic efficiency of exponential classes in terms of time complexity?

  • A) O(1)
  • B) O(nlogn)
  • C) O(n)
  • D) O(2n )
D) O(2n ) Explanation

Quick Links