Answer to Question #109687 in Algorithms for Gnanamani CT

Question

In this question, you are required to solve the 0-1 Knapsack problem for two knapsacks. You are given a set of n objects. The weights of the objects are w1, w2, . . . , wn, and the values of the objects are v1, v2, . . . , vn. You are given two knapsacks each of weight capacity C. If an object is taken, it may place in one knapsack or the other, but not both. All weights and values are positive integers. Design a Brute force algorithm that determines the maximum value of objects that can be placed into the two knapsacks. Your algorithm should also determine the contents of each knapsack. Justify the correctness and running time of your algorithm.

Answer 1

Dear Gnanamani CT, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order