7 T (n/2) + 1/n

Home / Engineering / Design and Analysis of Algorithms / Question

Mr. Dubey • 51.43K Points
Coach

Q.) 7 T (n/2) + 1/n

(A) t(n) = o(n)

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

(D) cannot be solved using master’s theorem

Correct answer : Option (D) - cannot be solved using master’s theorem

Explanation:

 the given recurrence cannot be solved by using the master’s theorem. it is because in this recurrence relation a < 1 so master’s theorem cannot be applied.

Discusssion

Related MCQs on Design and Analysis of Algorithms

Q. Data centers and centralized computing covers many and?

Q. A Von Neumann computer uses which one of the following?

Q. The 4 byte IP address consists of

Q. The RSA signature uses which hash algorithm?

Q. In real time operating system

Q. Which one of the following is not used to generate dynamic web pages?

Q. A module has _______if there is some logical relationship in the elements of a module.

Q. A PC not connected to a network is equivalent to

Q. Testing done without planning and Documentation is ca

Q. Which of the following is Relation-algebra Operation