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 13
no class
Oct 15
no class
Oct 17
no class
02 Oct 20
introduction / administrivia 
[slides, 8up]
Oct 22
recap 
[slides, 8up]
Oct 24
lab 
[slides]
03 Oct 27
analysis of algorithms 
[slides, 8up]
Oct 29
common algorithmic patterns 
[slides, 8up]
Oct 31
lab 
[slides]
04 Nov 03
sorting 
[slides, 8up]
Nov 05
trees 
[slides, 8up]
Nov 07
lab 
[slides]
05 Nov 10
heaps, priority queues 
[slides, 8up]
Nov 12
graphs: intro 
[slides, 8up]
Nov 14
lab 
06 Nov 17
graphs: traversals 
[slides, 8up]
Nov 19
directed graphs 
[slides, 8up]
Nov 21
lab 
[slides]
07 Nov 24
graphs: shortest paths 
[slides, 8up]
Nov 26
graphs: MST 
[slides, 8up]
Nov 28
lab 
[slides]
08 Dec 01
maps / hashes 
[slides, 8up]
Dec 03
string matching 
[slides, 8up]
Dec 05
lab 
09 Dec 08
edit distance 
[slides, 8up]
Dec 10
tries 
Dec 12
lab 
10 Dec 15
summary 
Dec 17
summary 
Dec 19
lab 
11 Dec 22
sem. break
Dec 24
sem. break
Dec 26
sem. break
12 Dec 29
sem. break
Dec 31
sem. break
Jan 02
sem. break
13 Jan 05
sem. break
Jan 07
FSA determinization / minimization 
Jan 09
lab 
14 Jan 12
FSA and regular languages 
Jan 14
FSTs 
Jan 16
lab 
15 Jan 19
Parsing: Intro 
Jan 21
CKY & Earley 
Jan 23
lab 
16 Jan 26
Dependency Parsing 
Jan 28
Dependency Parsing 
Jan 30
lab 
17 Feb 02
Dependency Parsing 
Feb 04
Summary & QA 
Feb 06
exam