Notes:
- The algorithms studied in lecture are: lcs, log cutting, 0/1 knapsack, weighted activity selection, edit distance, coin change, and seam carving (the latter with slightly less detail)
The questions on quiz 4 are:
- DP design: given a new DP algorithm, reason about it
- What is the runtime? What type of data structure would it need? That sort of thing.
- We currently have about almost 100 such algorithms; aiming for many more
- Log cutting: working through the algorithm described in class
- Weighted interval scheduling: working through the algorithm described in class
- DP question categorization: given various properties, which of the algorithms that we’ve studied match those properties? (given type of data structure, given runtime, etc.)
- Some number (5-10) of true/false questions from a very large question bank
- Currently 114 DP questions in the question bank, many more expected by tomorrow
The only change from last Thursday:
- If the exam is too long, we would shorten it by having each exam choose one of either (2) or (3)