McqMate

Q. |
## 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 |

C. | 16 seconds |

D. | 32 seconds |

Answer» B. 30 seconds | |

Explanation: number of moves = 24-1=16- 1=15 |

742

0

Do you find this helpful?

12

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the objective of tower of hanoi puzzle?
- Recurrence equation formed for the tower of hanoi problem is given by
- Tower of hanoi problem can be solved iteratively.
- You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
- Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?
- Which of the following problems can be used to solve the minimum number of insertions to form a palindrome problem?
- What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?
- What is the time complexity of the brute force algorithm used to solve the balanced partition problem?
- Find the maximum value output assuming items to be divisible.
- Find the maximum value output assuming items to be divisible and nondivisible respectively.