Consider the 0/1 Knapsack Problem. The problem can be solved to optimality via a dynamic programming...

 

Transcribed Image Text:

Consider the 0/1 Knapsack Problem. The problem can be solved to optimality via a dynamic programming algorithm. 1. (25 pts) Use the pseudocode of the dynamic programming (DP) algorithm that we have developed in the lecture. Implement DP in Java to find an optimal solution of 0/1 Knapsack Problem. - 2. (25 pts) Randomly generate the value v, [1, 40], the volume w, [10, 30], and set the total volume W Wi 1. Graphically represent the computation time for the input sizes n = 10, 50, 100, 200, 500. Report the console outputs and your Java code scripts. Consider the 0/1 Knapsack Problem. The problem can be solved to optimality via a dynamic programming algorithm. 1. (25 pts) Use the pseudocode of the dynamic programming (DP) algorithm that we have developed in the lecture. Implement DP in Java to find an optimal solution of 0/1 Knapsack Problem. - 2. (25 pts) Randomly generate the value v, [1, 40], the volume w, [10, 30], and set the total volume W Wi 1. Graphically represent the computation time for the input sizes n = 10, 50, 100, 200, 500. Report the console outputs and your Java code scripts.