[Solved] What is the result of the recurrences which fall under third case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
What is the result of the recurrences wh...

Q.	What is the result of the recurrences which fall under third case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
A.	none of the below
B.	t(n) = o(nc log n)
C.	t(n) = o(f(n))
D.	t(n) = o(n2)
Answer» C. t(n) = o(f(n))
Explanation: in third case of master’s theorem the necessary condition is that c > logba. if this condition is true then t(n) = o(f(n)).

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
What is the result of the recurrences which fall under the extended second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc(log n)k?
Under what case of Master’s theorem will the recurrence relation of merge sort fall?
Under what case of Master’s theorem will the recurrence relation of stooge sort fall?
Under what case of Master’s theorem will the recurrence relation of binary search fall?
We can solve any recurrence by using Master’s theorem.
Recurrence equation formed for the tower of hanoi problem is given by
Which case of master’s theorem can be extended further?
Which of the following recurrence relations can be used to find the nth fibonacci number?
What will be the recurrence relation of the code of recursive selection sort?