Answer to Question #327869 in Algorithms for vavanshu

Question

Find maximum Benefit in case of Knapsack Problem with Knapsack Capacity is given as 10 for 10 items with their weights and values respectively are (4,15),(3,12),(1,20),(3,40),(2,25),(5,30),(7,35),(2,45),(6,50),(4,16).Also mark the items which lead to the maximum benefit. Solve using Dynamic Programming. 

Answer 1

It's been a while since this question is posted here. Still, the answer hasn't been got. Consider converting this question to a fully qualified assignment, and we will try to assist. Please click the link below to proceed: Submit order