\3/ Question 6: CLO: <3>; Bloom Taxonomy Level: [Marks: 05+01+01+03 = 10] a) Apply the bottom-up dynamic programming al
Posted: Sun Jul 03, 2022 9:58 am
Question 6: CLO: <3>; Bloom Taxonomy Level: [Marks: 05+01+01+03 = 10] a) Apply the bottom-up dynamic programming algorithm to the following instance of the 0/1 knapsack problem. The weight capacity W = 11. Fill in the table given below. Item # Jā 1ā 13 14 Is Wi (weight of ith item) 4 2 3 1 6 bi (value of ith item) 9 3 5 the maximum value/benefit (B) that can be achieved? 6 may value/benefit (B)?
\3/