M

Mr. Dubey • 52.30K Points
Coach 

Q. Master’s theorem is used for?

(A) solving recurrences
(B) solving iterative relations
(C) analysing loops
(D) calculating the time complexity of any code
Correct : Option (A)

Explanation: 
 master’s theorem is a direct method for solving recurrences. we can solve any recurrence that falls under any one of the three cases of master’s theorem.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. What effect would have on the break-even point and expected profit if there is an increase in fixed cost?

Q. Which of the statements is true:

Q. Ensuring that no more than the allocated number of people are allocated at any given time in Software Scheduling is known as

Q. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of no

Q. Which of the following data structure is linear type?

Q. ____________ object which receives request from UI layer object and then controls/coordinates with other object.

Q. The first step in the naïve greedy algorithm is?

Q. Which one of the following is an internet standard protocol for managing devices on IP network?

Q. ALE stand for:

Q. Let <M> be the encoding of a Turing machine as a string over ∑= {0, 1}. Let L = { <M> |M is a Turing machine that accepts a string of