Cs141 Home/Lecture6

Cs141 Home | Cs141 Home | recent changes | Preferences

Difference (from prior major revision) (no other diffs)

Changed: 1c1
/Lecture5 /Lecture7?
/Lecture5

Removed: 4,5d3

UNDER CONSTRUCTION

/Lecture5

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.


Cs141 Home | Cs141 Home | recent changes | Preferences
This page is read-only | View other revisions
Last edited February 16, 2005 7:05 pm by Neal (diff)
Search: