t3feedssol - P [ i ] = max j P j [ i-1] where P j [ i-1]...

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

View Full Document Right Arrow Icon
COT 5405, Test 3 SOLUTIONS 1. (10 points) Let T [ i,aa,bb ] be a minimum time needed to complete job i by time aa on machine A and bb on machine bb .Th en T [ i,aa,bb ]= a i + min { T [ i - 1 ,aa - a i ,bb ] ,T [ i - 1 ,aa,bb - a i ] } ,andonceweknow T [ n, Σ a i , Σ a i ]the problem is solved. Overall time complexity is O ( M 2 N ). 2. (10 points) Let P [ i ] be optimal sequence of trades obtained using i
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: P [ i ] = max j P j [ i-1] where P j [ i-1] denotes modiFcation of P [ i-1] where transition from j th currency to next currency X is replaced by transition from j to i to X . Everycomputationof P [ i ]takes O ( n ) time, henceoverall complexity is O ( n 2 ). 1...
View Full Document

This note was uploaded on 11/30/2011 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.

Ask a homework question - tutors are online