Algorithm || 2021 MCQ || 2-mark || Module 1: Analysis of Algorithm

Last Updated :
Discuss
Comments

For constants a ≥ 1 and b > 1, consider the following recurrence defined on the non-negative integers:

T(n) = a T (n/b) + f(n)

Which one of the following options is correct about the recurrence T(n) ?
GATE CSE 2021,SET2 - [2Marks] (MCQ)


f(n) is O(nlogb(a)-∈) for some ∈>0, then T(n) is T(n)=Θ(n logb (a))

If f(n) is n/log2 (n), then T(n) is Θ(log2(n))

If f(n) is Θ(nlogb (a)), then

T(n) is Θ(nlogb (a))

If f(n) is n log2(n), then T(n) is Θ(nlog2(n))

This question is part of this quiz :

GATE|| Analysis of algorithm || Pyq(2010 to2025),GATE||Alogrithm ||Pyq (2010 to 2025)
Tags:
Analysis of Algorithms
GATE CS
Algorithms
Algorithms-Analysis of Algorithms
+1 More
Share your thoughts in the comments
Article Tags :