GATE 2021 CS Q30: T(n) = T(n/2) + T(2n/5) + 7n Recurrence Relation

Computer Sciences > GATE 2021 SET-1 > Analysis of Algorithms

Consider the following recurrence relation.
T(n) = T(n/2) + T(2n/5) + 7n if n > 0
T(n) = 1 if n = 0
Which one of the following options is correct?

T(n) = Θ(n5/2)

T(n) = Θ(n log n)

T(n) = Θ(n)

T(n) = Θ((log n)5/2)

Correct : c

Similar Questions

Consider the following C function. Which one of the following most closely approximates the return value of the function fun1?

#1152 MCQ

The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is _______.

#1210 NAT

Consider the following pseudocode. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do     for j = i to n...

#1213 MCQ