# Knapsack Problem This exercise is due Tuesday, May 14. It has to be turned in on time in order to get participation credit. I'll come into class and go over the solution right away. Then I will collect your work on the exercise. Be ready to turn it in at that time . Fill out the table for the knapsack problem, where the objects weights, and values are as given and the overall weight limit is 10 Next, circle the entries in the table that are used when backtracking to find objects to use in the solution. Then list the object numbers that can be used for an optimal solution. Also list the weights and values of those objects Verify that the values of your solution objects add up to the optimal number in the last row and column in the table Verify that the sum of the weights of your solution the objects is not more than the overall weight limit of 10 Weight Capacity - wt val 1 2 3 4 5 6 789 10 Here is a filled-out table for a similar problem: Total Weight -- #wtval 1 0 1 2 3 4 5 6 0 2 2 2 2 2 2 2 0 2 3 7 9 11 12 16 Let me know in class if you have questions about how such problems are solved. The algorithm is covered in section 6.4

Question

Knapsack Problem

This exercise is due Tuesday, May 14. It has to be turned in on time in order to get participation credit. I'll come into class and go over the solution right away. Then I will collect your work on the exercise. Be ready to turn it in at that time.

• Fill out the table for the knapsack problem, where the objects, weights, and values are as given, and the overall weight limit is 10.
• Next, circle the entries in the table that are used when backtracking to find objects to use in the solution.
• Then list the object numbers that can be used for an optimal solution.
• Also list the weights and values of those objects.
• Verify that the values of your solution objects add up to the optimal number in the last row and column in the table.
• Verify that the sum of the weights of your solution the objects is not more than the overall weight limit of 10.

Weight Capacity ----->

obj

#  wt val   |  0   1   2   3   4   5   6   7   8   9  10

_________________________________________________________

0  0   0   |   0   0   0   0   0   0   0   0   0   0   0

1  4   5   |   0

2  3   4   |   0

3  5   7   |   0

4  3   2   |   0

Here is a filled-out table for a similar problem:

Total Weight ----->

obj

#  wt val   |  0   1   2   3   4   5   6   7

_____________________________________________

0  0   0   |   0   0   0   0   0   0   0   0

1  1   2   |   0   2   2   2   2   2   2   2

2  4   9   |   0   2   2   2   9  11  11  11

3  3   7   |   0   2   2   7   9  11  11  16

4  2   3   |   0   2   3   7   9  11  12  16

Let me know in class if you have questions about how such problems are solved. The algorithm is covered in section 6.4.

## Expert Answer

1 Rating

### Want to see this answer and more?

Experts are waiting 24/7 to provide step-by-step solutions in as fast as 30 minutes!*

*Response times may vary by subject and question complexity. Median response time is 34 minutes for paid subscribers and may be longer for promotional offers.
Tagged in
Engineering
Computer Science