This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2a. Solve the following 01 Knapsack problem using the Dynamic Programming algorithm: Objects {(2 lbs, $10), (4 lbs, $2), (2 lbs, $5), (3 lbs, $6)}, Knapsack limit 10lbs. Follow the same order for objects as in the question [UG: 10, Grad: 8] 2b[only for Grad]. Retract the knapsack content from your table, showing the vertical pointers or any other form of explanation. [Grad: 2] 3. Using Dynamic Programming algorithm find out the minimum number of scalar multiplications required for the following chain of matrices A1.A2.A3.A4, where the dimensions of the matrices are (5x1), (1x7), (7x3) and (3x3)respectively. [10]...
View
Full
Document
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.
 Spring '12
 Dmitra
 Algorithms

Click to edit the document details