Design and Analysis of Algorithms MCQs with Answers
Practice important Design and Analysis of Algorithms MCQs with answers and explanations.
Multiple Choice Questions
Q31: When advancing the sweep line, what operation is performed if a point is dominated?
- A: Insert into stack
- B: Pop from stack
- C: Update y-coordinate
- D: Insert at beginning
View Answer
B
Q32: What does Θ(g(n)) represent in asymptotic notation?
- A: Upper bound
- B: Lower bound
- C: Exact growth rate
- D: Average case
View Answer
C
Q33: Which function represents the fastest growth rate as n becomes large?
- A: 4n^2
- B: (8n^2 + 2n - 3)
- C: n(n - 3)
- D: √(n) - 10 log n
View Answer
A
Q34: In asymptotic notation, what is required for f(n) ∈ Θ(g(n))?
- A: Only an upper bound
- B: Both upper and lower bounds
- C: Exact growth match
- D: Only a lower bound
View Answer
B
Q35: Which of these functions is NOT asymptotically equivalent to Θ(n^2)?
- A: 4n^2
- B: 8n^2 + 2n - 3
- C: 7n^2 + √n - log n
- D: n^3
View Answer
D
Q36: If f(n) ∈ O(g(n)), which statement is correct?
- A: f(n) has a strict lower bound only
- B: f(n) has a strict upper bound only
- C: f(n) has both lower and upper bounds
- D: f(n) has neither bound
View Answer
B
Q37: What is the smallest asymptotic class of time complexity commonly used in algorithms?
- A: Θ(1)
- B: Θ(log n)
- C: Θ(n)
- D: Θ(n log n)
View Answer
A
Q38: In Θ-notation, which condition applies to two functions f(n) and g(n)?
- A: They have exact growth rates
- B: They have asymptotically equivalent growth rates
- C: g(n) grows faster
- D: They both approach infinity equally
View Answer
B
Q39: Which function would likely fall into Θ(log n) time complexity?
- A: Finding an element in a list
- B: Sorting an unsorted array
- C: Inserting into a binary tree
- D: Reversing an array
View Answer
C
Q40: Fill in the blank: For f(n) ∈ Ω(g(n)), the function f(n) has an asymptotic ______ bound.
- A: lower
- B: upper
- C: exact
- D: middle
View Answer
A