

MCQOPTIONS
Saved Bookmarks
1. |
Which of the following methods can be used to solve the Knapsack problem? |
A. | Brute force algorithm |
B. | Recursion |
C. | Dynamic programming |
D. | All of the mentioned |
Answer» E. | |