Q280
The Knapsack problem is an example of . . . . . . . .
A.
Greedy algorithm
B.
2D dynamic programming
AnswerC.
1D dynamic programming
D.
Divide and conquer
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board