M

Mr. Dubey • 100.69K Points
Coach

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

  • (A) t(n) = o(n)
  • (B) t(n) = o(log n)
  • (C) t(n) = o(n2log n)
  • (D) cannot be solved using master’s theorem
Share
Explanation by: Mr. Dubey
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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Which of the following is used by IS-95?

Q. IPv6 has -bit addresses.

Q. When an input signal A=11001 is applied to a NOT gate serially, its output signal is

Q. laser Printer is also known as

Q. Automatic protection switching in linear network is defined at the _______

Q. The scientific technique of task setting is known as ......................

Q. The associative mapping is costlier than direct mapping.

Q. The difference between the actual Y value and the predicted Y value found using a regression equation is called the

Q. Conventional cryptography is also known as _____________ or symmetric-key encryption.

Q. The size of a page is typically

Question analytics