Scribd
Upload
4 views1 page

Tutorial 12

The document contains tutorial exercises for Algorithm Analysis and Design at Xiamen University Malaysia, focusing on the knapsack problem. It requires the application of a bottom-up dynamic programming algorithm to a specific instance of the problem and the implementation of the solution. Additionally, students are encouraged to use remaining tutorial time for their assignments.

Uploaded by

johnrichards5741
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Tutorial 12

The document contains tutorial exercises for Algorithm Analysis and Design at Xiamen University Malaysia, focusing on the knapsack problem. It requires the application of a bottom-up dynamic programming algorithm to a specific instance of the problem and the implementation of the solution. Additionally, students are encouraged to use remaining tutorial time for their assignments.

Uploaded by

johnrichards5741
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Xiamen University Malaysia Tutorial Exercises

Algorithm Analysis and Design


Tutorial 12
1. Apply the bottom-up dynamic programming algorithm to the following
instance of the knapsack problem:

Item Weight Value


1 3 $25
2 2 $20
3 6 $5
4 4 $40
5 5 $45

Capacity W = 15.

Be sure to show the steps you took to solve the problem.

2. Implement the solution to the knapsack problem above.

Once you have completed the tutorial exercises, you may use the remaining of your tutorial
time to work on your Assignment.

Page 1 of 1

You might also like