Dynamic Programming

**1.**The Knapsack problem where the objective function is to minimize the profit is ______

**2.**For 0/1 KNAPSACK problem, the algorithm takes ________ amount of time for memory table, and ______time to determine the optimal load, for N objects and W as the capacity of KNAPSACK.

**3.**

From the following choose the one which belongs to the algorithm paradigm other than to which others from the following belongs to.

**4.**The optimal solution to a problem is a combination of optimal solutions to its subproblems. This is known as

**5.**

From the following choose the one which belongs to the algorithm paradigm other than to which others from the following belongs to.

**6.**In Knapsack problem, the best strategy to get the optimal solution, where Pi, Wi is the Profit, Weight associated with each of the Xith object respectively is to

**7.**Find the odd one out.

**8.**From the following pick the one which does not belongs to the same paradigm to which others belongs to.

**9.**

The method will choosing when sub problems share sub problems

**10.**

which is not feasible solution in the case of job sequence problem

Item | 1 | 2 | 3 | 4 |

Profit | 100 | 10 | 15 | 27 |

deadline | 2 | 1 | 2 | 1 |