6. Given the weigh vector (2,3,5,7,1,4,1) and the profit vector (10,5,15,7,6,18,3) and a knapsack of capacity...

 

Transcribed Image Text:

6. Given the weigh vector (2,3,5,7,1,4,1) and the profit vector (10,5,15,7,6,18,3) and a knapsack of capacity 15. Find the optimal solution for the knapsack problem. 7. Find the minimum number of operations required for the following matrix chain multiplication using dynamic programming: A(10 X 20) * B (20 X 50) * C (50X1)*D (1 X 100) 6. Given the weigh vector (2,3,5,7,1,4,1) and the profit vector (10,5,15,7,6,18,3) and a knapsack of capacity 15. Find the optimal solution for the knapsack problem. 7. Find the minimum number of operations required for the following matrix chain multiplication using dynamic programming: A(10 X 20) * B (20 X 50) * C (50X1)*D (1 X 100)