What is the objective of the knapsack problem?
(a) To get maximum total value in the knapsack
(b) To get minimum total value in the knapsack
(c) To get maximum weight in the knapsack
(d) To get minimum weight in the knapsack
I have been asked this question in an interview for internship.
Enquiry is from Greedy Algorithms topic in section Greedy Algorithms of Data Structures & Algorithms II