{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Hw2Fl04

# Hw2Fl04 - 2a Solve the following 0-1 Knapsack problem using...

This preview shows page 1. Sign up to view the full content.

CSE 4081/5200 Fall 2004 Home Work 2 Points 30 Due: November 9 1. Set up the recurrence equation for time complexity of the following algorithm and solve it for the usual theta function (asymptotic time-complexity). [10] Algorithm Little (int array A[], int start, int end) begin if start == 1 do return // null else Little (A, start-1, end); end algorithm. {Hint: the driver making the first call of the algorithm may be Little(A, n, n), where n is the array size } For the following two questions you must show the cost matrix and at least the full calculation for the final element of the cost matrix. You need not show the calculation for each element of the cost matrix.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2a. Solve the following 0-1 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

{[ snackBarMessage ]}