- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- If a problem can be broken into subprobl...

Q. |
## If a problem can be broken into subproblems which are reused several times, the problem possesses property. |

A. | overlapping subproblems |

B. | optimal substructure |

C. | memoization |

D. | greedy |

Answer» A. overlapping subproblems | |

Explanation: overlapping subproblems is the property in which value of a subproblem is used several times. |

View all MCQs in:
Design and Analysis of Algorithms

- When dynamic programming is applied to a problem, it takes far less time as compared to other methods that don’t take advantage of overlapping subproblems.
- In divide and conquer, the time is taken for merging the subproblems is?
- Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
- Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?
- 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 n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
- 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
- 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?
- There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.
- Subset sum problem is an example of NP- complete problem.

Login to Continue

It will take less than 2 minutes

Report MCQ