We use dynamic programming approach when
(A) We need an optimal solution
(B) The solution has optimal substructure
(C) The given problem can be reduced to the 3-SAT problem
(D) It’s faster than Greedy
Answer: (B)
Explanation: http://www.geeksforgeeks.org/dynamic-programming-set-2-optimal-substructure-property/
Option (D) is incorrect because Greedy algorithms are generally faster than Dynamic programming. See http://www.geeksforgeeks.org/greedy-algorithms-set-1-activity-selection-problem/
Quiz of this Question
Recommended Posts:
- Algorithms | Dynamic Programming | Question 7
- Algorithms | Dynamic Programming | Question 3
- Algorithms | Dynamic Programming | Question 4
- Algorithms | Dynamic Programming | Question 5
- Algorithms | Dynamic Programming | Question 7
- Algorithms | Dynamic Programming | Question 7
- Algorithms Quiz | Dynamic Programming | Question 8
- Number of Unique BST with a given key | Dynamic Programming
- Algorithms | Analysis of Algorithms (Recurrences) | Question 1
- Algorithms | Analysis of Algorithms (Recurrences) | Question 2
- Algorithms | Analysis of Algorithms | Question 1
- Algorithms | Analysis of Algorithms (Recurrences) | Question 3
- Algorithms | Analysis of Algorithms | Question 2
- Algorithms | Analysis of Algorithms | Question 3
- Algorithms | Greedy Algorithms | Question 1
- Algorithms | Analysis of Algorithms | Question 4
- Algorithms | Analysis of Algorithms | Question 5
- Algorithms | Analysis of Algorithms | Question 19
- Algorithms | Analysis of Algorithms | Question 19
- Algorithms | Analysis of Algorithms (Recurrences) | Question 4
