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?

Mr. Dubey • 52.30K Points
Coach

Q. 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?

(A) none of the below

(B) t(n) = o(nc log n)

(D) t(n) = o(n2)

Correct : Option (B)

Explanation:

 in second case of master’s theorem the necessary condition is that c = logba. if this condition is true then t(n) = o(nc log n)

Discusssion

Loading Comments....

Q. The data in the database at a particular moment in time is called a ________________

Q. A process can be

Q. print(myList[i], end = " ")

Q. Which of the following are characteristics of testable software?

Q. ____________ is the ability of multiple processes to co-ordinate their activities by exchange of information.

Q. Sub-Properties (sub-types of individual intelligence) of Individual Intelligence includes

Q. Outputs are functions of

Q. Managers are typically integrators of

Q. Recursively enumerable languages are not closed under:

Q. 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?

Discusssion

Related MCQs