Vidyalelo
Data Structure · Q405

Miscellaneous on Data Structures

Programming · Data Structure · question 405

Q405

Minimum time required to solve tower of hanoi puzzle with 4 disks assuming one move takes 2 seconds, will be . . . . . . . .

A.
15 seconds
B.
30 seconds
Answer
C.
16 seconds
D.
32 seconds

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board