Moon's day | Woden' s day | Frigga's day |
---|
|
|
Aug 30 |
Review of algorithmic analysis and correctness proof (CLRS 2) Slides |
|
|
|
Sept 4 |
More review (CLRS 2). Slides |
|
|
Sept 6 |
Asymptotics (CLRS 3) Slides |
|
|
Sept 9 |
More about asymptotics (CLRS 3) Slides |
|
|
Sept 11 |
More about asymptotics (CLRS 3); begin divide and conqure (CLRS 4) Slides |
|
|
Sept 13 |
Solving recurrences (CLRS 4) |
|
|
Sept 16 |
The master method (CLRS 4) Slides |
|
|
|
Sept 20 |
Limits of comparison-based sorting (CLRS 8) Slides |
|
|
Sept 23 |
Amortized analysis (CLRS 17) Slides |
|
|
Sept 25 |
Dynamic programming (CLRS 15) Slides |
|
|
Sept 27 |
Dynamic programming (CLRS 15) Slides |
|
|
Sept 30 |
Finish DP (CLRS 15) Slides |
|
|
Oc 2 |
Greedy algorithms (CLRS 16) Slides |
|
|
Oct 4 |
Greedy algorithms (CLRS 16) Slides |
|
|
Oct 7 |
Greedy algorithms (CLRS 16) |
|
|
|
|
Oct 14 |
Greedy algorithms; Huffman encoding Slides |
|
|
Oct 16 |
Fast Fourier Transform (CLRS 30) Slides |
|
|
Oct 18 |
Fast Fourier Transform (CLRS 30) Slides |
|
|
|
|
|
Oct 28 |
Finite automata (LP 2) Slides |
|
|
Oct 30 |
Finite automata and regular expressions (LP 2) Slides |
|
|
Nov 1 |
Context-free languages (LP 3) |
|
|
Nov 4 |
Push-down automata (LP 3) |
|
|
|
|
Nov 11 |
Turing machines (LP 4.1) Slides |
|
|
Nov 13 |
Turing machines (LP 4.(2-4)) Slides |
|
|
Nov 15 |
Non-deterministic Turing machines (LP 4.(5)) Slides |
|
|
Nov 18 |
Undecideability (LP 5) Slides |
|
|
Nov 20 |
Undecidability (LP 5) |
|
|
Nov 22 |
Finish undecidability; start computational complexity (LP 6) Slides |
|
|
Nov 25 |
Computational complexity (LP 6) Slides |
|
|
|
|
Dec 2 |
Finish computational complexity Slides |
|
|
Dec 4 |
NP-completeness (LP 7) Slides |
|
|
Dec 6 |
NP-complete problems (CLRS 34 and LP 7) Slides |
|
|
Dec 9 |
Algorithmic approach to NP-completeness (CLRS 34) |
|
|
Dec 11 |
Concluding remarks on NP-completeness Slides |
|
|
|