DAA CSE 356 QUIZ 1

1. Which of the following is NOT a valid asymptotic notation?

• O(n)

• Ω(n)

• Θ(n)

• Σ(n)

1. If a function f(n) is O(g(n)), which of the following is true?

• f(n) grows faster than g(n)

• 1. f(n) grows slower than g(n)

• f(n) grows at most as fast as g(n)

• g(n) grows slower than f(n)

1. Which asymptotic notation provides both an upper and a lower bound?

• O(n)

• Ω(n)

• Θ(n)

• o(n)

1. What does O(1) represent in algorithm analysis?

• Constant time complexity

• Linear time complexity

• Logarithmic time complexity

• Exponential time complexity

1. If f(n) = n² + 3n + 4, what is the Big-O notation?

• 1. O(n)

• O(n²)

• O(log n)

• O(n³)

1. If f(n) is Θ(g(n)), which of the following statements is true?

• f(n) = o(g(n))

• f(n) = O(g(n))

• 1. f(n) = Ω(g(n))

• Both b and c

1. Which notation describes an algorithm that has a lower bound but no upper bound?

• O(n)

• Ω(n)

• Θ(n)

• o(n)

1. If a function f(n) is Θ(n log n), which of the following is true?

• f(n) = O(n)

• f(n) = Ω(n log n)

• f(n) = O(n²)

• Both b and c

1. Which of the following best describes a function that grows faster than logarithmic time but slower than linear time?

• O(log n)

• O(n)

• O(n log n)

• O(n^(1/2))

1. If f(n) = 3n³ + 2n² - n + 5, what is the Big-O notation?

• O(n²)

• O(n³)

• O(n)

• O(log n)