M

Mr. Dubey • 52.30K Points
Coach 

Q. Under what case of Master’s theorem will the recurrence relation of binary search fall?

(A) 1
(B) 2
(C) 3
(D) it cannot be solved using master’s theorem
Correct : Option (B)

Explanation: 
 the recurrence relation of binary search is given by t(n) = t(n/2) + o(1). so we can observe that c = logba so it will fall under case 2 of master’s theorem.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. If R= {(x, 2x)} and S= {(x, 5x)} then R composition S=____.

Q. The technique whereby the DMA controller steals the access cycles of the processor to operate is called

Q. frees the space occupied by a block as soon as the final tuple of that block has been processed.

Q. involves the revelation of truthful

Q. Which of the following is a type of free vibration?

Q. Fifth generation computer is also known as

Q. Open IoT manages the registration, data acquisition, deployment of sensors and interconnected of objects, through which network?

Q. There are 6 equally spaced points A, B, C, D, E and F marked on a circle with radius R. How many convex heptagons of distinctly different areas can be

Q. The parallel execution of operations in VLIW is done according to the schedule determined by .....

Q. In C++ there can be an array of four dimensions.