Links to the course material will be provided in the schedule below after each class. You may want to have a look at the previous edition of the course for reference.

The course schedule

Week	Monday	Wednesday	Friday
01	Oct 16 no class	Oct 18 no class	Oct 20 no class
02	Oct 23 introduction / administrivia  [slides, 8up]	Oct 25 recap  [slides, 8up]	Oct 27 Assignment 0  [description]
03	Oct 30 postponed	Nov 01 no class	Nov 03 analysis of algorithms  [slides, 8up]
04	Nov 06 common algorithmic patterns  [slides, 8up]	Nov 08 sorting  [slides, 8up]	Nov 10 Assignment 1  [description]
05	Nov 13 trees  [slides, 8up]	Nov 15 heaps, priority queues  [slides, 8up]	Nov 17 Assignment 2  [description]
06	Nov 20 graphs: intro  [slides, 8up]	Nov 22 graphs: traversals  [slides, 8up]	Nov 24 Assignment 3  [description]
07	Nov 27 directed graphs  [slides, 8up]	Nov 29 shortest paths  [slides, 8up]	Dec 01 Assignment 4  [description]
08	Dec 04 graphs: MST  [slides, 8up]	Dec 06 maps / hashes  [slides, 8up]	Dec 08 Assignment 5  [description]
09	Dec 11 string matching  [slides, 8up]	Dec 13 string matching	Dec 15 Assignment 6  [description]
10	Dec 18 edit distance  [slides, 8up]	Dec 20 tries  [slides, 8up]	Dec 22 Assignment 6
11	Dec 25 sem. break	Dec 27 sem. break	Dec 29 sem. break
12	Jan 01 sem. break	Jan 03 sem. break	Jan 05 sem. break
13	Jan 08 FSA intro  [slides, 8up]	Jan 10 FSA determinization / minimization  [slides(d), s8up(d), slides(m), s8up(m)]	Jan 12 Assignment 8  [description]
14	Jan 15 FSTs  [slides, 8up]	Jan 17 FSA and regular languages  [slides, 8up]	Jan 19 Assignment 9  [description]
15	Jan 22 CFG Parsing: Intro  [slides, 8up]	Jan 24 CKY & Earley  [cky, cky-handout, earley, earley-handout]	Jan 26 Assignment 9
16	Jan 29 Dependency parsing  [slides, 8up]	Jan 31 Dependency parsing	Feb 02 Finite-state morphology tutorial (optional)  [description]
17	Feb 05 summary/project discussion	Feb 07 exam discussion, Q&A	Feb 09 exam