| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
|
| |
|
|
| |
|
|
| |
|
|
| |
|
|
Sept 28 |
|
Greedy algorithms (CLRS 16) |
Daily: Read Section 16.4; do 16.4-1.
|
|
|
Oct 1 |
|
Greedy algorithms (CLRS 16)
Slides |
Daily: Read Section 17.(1-3); do 17.1-(1 & 3), 17.2-2
|
|
|
Oct 3 |
|
Amortized analysis (CLRS 17)
Slides |
HW assigned 9/24 due
|
|
|
| |
|
|
|
Oct 15 |
|
B-trees |
Daily: Read 30.(1&2). Do 30.1-(2 & 3)
|
|
|
Oct 17 |
|
Fast Fourier Transform |
Daily: Read 30.3. Some exercises...
|
|
|
| |
|
|
Oct 26 |
|
Computational geometry |
Daily: Read 33.3
|
|
|
Oct 29 |
|
Computational geometry |
|
|
|
Oct 31 |
|
Review |
HW assigned 10/19 due
|
|
|
Nov 2 |
|
TEST |
Daily: Review LP Ch 1 as necessary. Read 2.(1&2); do 2.2.(6 & 10)
|
|
|
Nov 5 |
|
Review finite automata (LP 2) |
Daily: Read 2.(3 & 4), 3.(1 & 2)
|
|
|
Nov 7 |
|
Finite automata and regular expressions (LP 2); begin context-free languages (LP 3) |
Daily: Reread 3.(1&2) as necessary; read 3.3 carefully; get the main points of 3.(4 & 5); do 3.3.2 (a, b)
|
|
|
Nov 9 |
|
Review context-free languages (LP 3) |
Daily: Read 4.1, do 4.1.1
|
|
| |
|
Nov 14 |
|
Turing machines (LP 4.(2-4)) |
Daily: Read 4.5; do 4.5.1
|
|
|
Nov 16 |
|
Non-deterministic Turing machines (LP 4.(5)) |
Daily: Read 5.(1-4); determine the main point for every section
|
|
| |
|
|
|
Nov 26 |
|
Undecidability (LP 5)
Slides |
Daily: Read 6.(1-4)
|
|
|
Nov 28 |
|
Finish undecidability; start computational complexity (LP 6) |
|
|
|
Nov 30 |
|
Computational complexity (LP 6) |
Reread 6.(3 & 4); do 6.3.2
|
|
|
Dec 3 |
|
Finish computational complexity |
Daily: Read 7.(1 & 2)
|
|
|
|
Dec 7 |
|
NP-complete problems (CLRS 34 and LP 7) |
Daily: Do 7.3.4 (a, b, & c)
|
|
|
Dec 10 |
|
Algorithmic approach to NP-completeness (CLRS 34)
Slides |
|
|
|
Dec 12 |
|
Concluding remarks on NP-completeness |
HW assigned 12/5 due next day
|
|
|