Lecture schedule
The material below is provided for reference. Please use the material from more recent course when available.
| Week | Monday (lecture) | Wednesday (lecture) | Friday (lab) |
|---|---|---|---|
| 01 | Oct 21 Introduction & Language Guessing |
Oct 23 Analysis of Algorithms |
Oct 25 Introduction to Python, Assignment 0.1 (ungraded) |
| 02 | Oct 28 Sorting - Insertion Sort & Quicksort |
Oct 30 Priority Queues, Binary Heaps & Heapsort |
Nov 1 No class |
| 03 | Nov 04 String Distance Measures |
Nov 06 Tries |
Nov 08 Graded Assignment 1, More Python Features, Python Class, Generator and Tuple Unpacking Examples |
| 04 | Nov 11 Graphs |
Nov 13 Graph Traversals |
Nov 15 Graded Assignment 1 (cont'd), Running time intuitions, k-connectivity of graphs |
| 05 | Nov 18 Directed graphs |
Nov 20 Shortest Paths |
Nov 22 Graded Assignment 2, Argparse Example Code |
| 06 | Nov 25 Minimum Spanning Trees |
Nov 27 Hash Tables |
Nov 29 Graded Assignment 2 (cont'd) |
| 07 | Dec 02 Formal Languages and Automata (8up) |
Dec 04 Finite State Automata and Regular Languages (8up) |
Dec 06 Graded Assignment 3 |
| 08 | Dec 09 Finite State Automata and Regular Languages (cont'd) |
Dec 11 Finite State Automata and Regular Languages (cont'd) |
Dec 13 Graded Assignment 3 (cont'd) |
| 09 | Dec 16 Finite State Transducers (8up) |
Dec 18 Applications of finite-state methods in CL |
Dec 20 Graded Assignment 4 |
| Sem. break | No class |
No class |
No class |
| 10 | Jan 06 No class |
Jan 08 Finite-state morphological analyzers |
Jan 10 Graded Assignment 4 (cont'd) |
| 11 | Jan 13 Context-free grammars and constituency parsing (8up) |
Jan 15 Dependency grammars (8up) |
Jan 17 Graded Assignment 5 |
| 12 | Jan 20 Dependency parsing (8up) |
Jan 22 Dependency parsing |
Jan 24 Graded Assignment 5 (cont'd) |
| 13 | Jan 27 Dependency parsing |
Jan 29 Dependency parsing |
Jan 31 Graded Assignment 6 |
| 14 | Feb 03 General Summary/Q&A |
Feb 05 Discuss Practice Exam |
Feb 07 Exam |