This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Input: (w, p) = ((3, 2), (8, 12), (5, 7)), the knapsacklimit by weight is M=7. GRAD 3b. Show how you would find the knapsack content from the matrix. [2] .4. Apply the dynamic programming algorithm for solving the following matrix chainproduct problem. Show the full matrix and details of a sample calculation for each of the subproblem sizes >2. Input sequence of matrixdimensions: (4x1)(1x5)(5x2)(2x3)(3x1) GRAD 4b. Keep track of the breakpoint data and recover the actual optimal order of matrixchain multiplication in the above problem. [2]...
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