Question

In dynamic programming, problems must comply with the property of calculating only once a solution to a subproblem and then to optimize it by reusing the result obtained. What is the name of such property

a) Overlapping subproblems

b) Globally optimal

c) None of the above

d) Feasible

e) Optimal substructure

f) Locally optimal

g) Irrevocable

Answer 1

ANSWER - (a) Overlapping subproblems

Dynamic programming in computer programming is a technique which is used to solve optimization problem.

There are two main properties or characteristics of dynamic programming problem, they are -

1. Overlapping subproblems
2. Optimal Substructure

Overlapping subproblems is the property in which solution is calculated only once to the subproblem and then optimising the solution again to use the result several times again.

So, the correct option is (a) Overlapping subproblems.

=================================END================================

Please comment if u need any other info and DO LEAVE A LIKE, it would mean a lot. Thanks :)