ISRO2018-16

Question

The following paradigm can be used to find the solution of the problem in minimum time:

Given a set of non-negative integer and a value $K$, determine if there is a subset of the given set with sum equal to $K$:

1. Divide and Conquer
2. Dynamic Programming
3. Greedy Algorithm
4. Branch and Bound

Comments

option b..dynamic programming.

Answer 1

it's subset sum problem which required dynamic programming to solve.so option B is correct.