- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Tower of hanoi problem can be solved ite...

Q. |
## Tower of hanoi problem can be solved iteratively. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: iterative solution to tower of hanoi puzzle also exists. its approach depends on whether the total numbers of disks are even or odd. |

View all MCQs in:
Design and Analysis of Algorithms

- Recurrence equation formed for the tower of hanoi problem is given by
- What is the objective of tower of hanoi puzzle?
- Minimum time required to solve tower of hanoi puzzle with 4 disks assuming one move takes 2 seconds, will be
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- You are given infinite coins of 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. This problem can be solved using
- In what time can the Hamiltonian path problem can be solved using dynamic programming?
- The travelling salesman problem can be solved using
- The 0-1 Knapsack problem can be solved using Greedy algorithm.
- Which of the following problems can be solved using the longest subsequence problem?
- Fractional knapsack problem can be solved in time O(n).

Login to Continue

It will take less than 2 minutes

Report MCQ