...
GATE 2005-IT
October 12, 2023
GATE 2021 CS-Set-2
October 12, 2023
GATE 2005-IT
October 12, 2023
GATE 2021 CS-Set-2
October 12, 2023

Algorithms

Question 49

Let T(n) be a function defined by the recurrence T(n) = 2T(n/2) + √n for n ≥ 2 and T(1) = 1 Which of the following statements is TRUE?

A
T(n) = θ(log n)
B
T(n) = θ(√n)
C
T(n) = θ(n)
D
T(n) = θ(n log n)
Question 49 Explanation: 
Apply Master’s theorem.
Correct Answer: C
Question 49 Explanation: 
Apply Master’s theorem.

Leave a Reply

Your email address will not be published. Required fields are marked *