*Session 2 Agenda*

### First segment (about an hour)

- Review last session slides - binomial expansion for rod cutting
**(keep slides open)**
- Miscellaneous problems from last session - see Assignment: Miscellaneous
**(Whiteboard)**
- In-class exercise - minimum edit distance
**(Handout)**
- In-class exercise - spelling auto correct
**(Do online)**

### Second segment (about an hour)

- Chap 32 slides
**(Handout)** - stop at section 1 problems
- Section 1 problems
**(Whiteboard)**
- Continue Chap 32 slides
- Section 3 problems - last slide
**(Whiteboard)**

### Next session preview

- Greedy algorithms - see Assignment: Rod Cutting
- Derivation of Viterbi (elastic matching, DTW) algorithm from finite-state-machine model
- Discussion of how string matching is done today - see Assignment: string match