Question

If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.
a. True
b. False

Answer 1

Answer:

true....✌❤✌#⃣✌❤✌#⃣......

Answer 2

" Option A)  True ".

Explanation:

Optimal substructure :

Optimal substructure is a specific property of some problems and it is not exclusive to dynamic programming. In other words, actually many problems have optimal substructures,  but most of them do not have overlapping subproblems, so we cannot classify them dynamic programming problem

If a dynamic programming problem satisfies the optimal substructure property, then a locally optimal solution is globally optimal

In computer science, a problem is said to have optimal substructure, if an optimal solution can be constructed from solutions of its sub-problems. This property is used to determine the availment of dynamic programming and greedy algorithms for a problem.

The dynamic programming problem :

There are two important attributes that a problem must have in order for dynamic-programming to be applicable

(i) optimal substructure

(ii) overlapping subproblems

Conquer and divide strategy is called as, if a problem can be solved by combining optimal solutions to non overlapping sub-problems.