UGC NET CSE | August 2024 | Part 2 | Question: 48

Question

Arrange the following steps in the correct order to solve the Knapsack problem using Dynamic Programming.

1. Define the base case when the capacity is zero ($0$) or no items are left to consider
2. Compute the maximum value that can be obtained using items up to the $i$-th item and a knapsack capacity of $0$.
3. Identify subproblems and their dependencies based on items weights and values
4. Initialize a table to store results of subproblems
5. Iterate through each item and each possible Capacity to fill the table

Choose the correct answer from the options given below:

• A. $\text{(III), (IV), (I), (V), (II)}$
• B. $\text{(IV), (III), (I), (V), (II)}$
• C. $\text{(I), (III), (IV), (V), (II)}$
• D. $\text{(IV), (I), (III), (V), (II)}$

Answer 1

Think this question as you are writting a coding problem   you wil get answer c