Cs141 Home/Lecture6

Dynamic Programming, continued

1. finish n choose k -- how to use (n choose k) = (n-1 choose k-1) + (n-1 choose k) to compute (n choose k). (see S04_CS141:NChooseKByDP)

2. exercises: shortest path, longest path, number of paths with an odd number of edges

3. subset sum (see S04_CS141:SubsetSumByDP)

reading: Read the short section (11.5) in the text on dynamic programming.