This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: IE170 Lab #5 Udom Janjarassuk IE 170 – Lab #5: Dynamic Programming  Knapsack Problems Due Date: February 26, 2007. 11:10AM. 1 Description and Objectives In this lab, we will implement Java code for solving the Knapsack problem by using the dynamic programming technique. We will also monitor the running time of the algorithm by varying certain parameters. Lab Objectives 1. Understand the principle of dynamic programming. 2. Understand how to implement data structures for dynamic programming. 3. Understand the complexity of the algorithm using dynamic programming. 2 Knapsack Problems The Knapsack problem we attempt to solve is called 01 Knapsack problem. Given a knapsack of capacity b , we will like to fit as many items as we can to maximize the total value. Each item j has a size a j and prize c j . If item j is sellected, then we added prize c j to our total value. 2.1 Problem Think before you code! Write down the stage, state, and recursive relationship you are trying to implement.trying to implement....
View
Full Document
 Spring '07
 Ralphs
 Dynamic Programming, Recursion, Systems Engineering, Computational complexity theory, Knapsack problem, 01 Knapsack problem, Udom Janjarassuk

Click to edit the document details