1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. The Knapsack problem is an example of
Q.

The Knapsack problem is an example of

A. greedy algorithm
B. 2d dynamic programming
C. 1d dynamic programming
D. divide and conquer
Answer» B. 2d dynamic programming
Explanation: knapsack problem is an example of 2d dynamic programming.

Discussion