M

Mr. Dubey • 100.69K Points
Coach

Q. Recurrence equation formed for the tower of hanoi problem is given by

  • (A) t(n) = 2t(n-1)+n
  • (B) t(n) = 2t(n/2)+c
  • (C) t(n) = 2t(n-1)+c
  • (D) t(n) = 2t(n/2)+n
Share
Explanation by: Mr. Dubey
as there are 2 recursive calls to n-1 disks and one constant time operation so the recurrence relation will be given by t(n)

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The probability that a person owns a sports car given that they subscribe to automotive magazine is 40%. We also know that 3% of the adult population

Q. PAL refers to

Q. _______ Cryptography deals with traditional characters, i.e., letters & digits directly.

Q. refers to an increase in the performance by the addition of more resources along the service layers

Q. abc*+de*f+g*+ where a=1, b=2, c=3, d=4, e=5, f=6, g=2.

Q. For a function of ‘n’ variables, the robustness testing will yield how many cases

Q. “Robustness” answers which of the following description?

Q. Which characteristics involve the facility the thing to respond in an intelligent way to a particular situation?

Q. In most of the IBM PCs, the CPU, the device drivers, memory, expansion slots and active components are mounted on a single board. What is the name of

Q. What is the time complexity of searching for an element in a circular linked list?

Question analytics