| Date |
Class Period & Lecture Topic |
Reading |
|
Assignment |
| Aug 31 |
1. Syllabus, policies, business |
|
|
|
| Sep 02 |
2. Introduction and basic concepts |
Chapter 0 |
pp. 1-16 |
|
| Sep 04 |
3. Definitions, theorems and proofs |
|
pp. 17-25 |
1 |
| Sep 07 |
Labor Day |
|
|
|
| Sep 09 |
4. Finite automata |
Chapter 1 |
pp. 31-38 |
2 |
| Sep 11 |
5. Finite automata cont. |
|
pp. 39-47 |
3 |
| Sep 14 |
6. Nondeterminism |
|
pp. 47-54 |
4 |
| Sep 16 |
7. Equivalence of DFAs and NFAs |
|
pp. 54-63 |
5 |
| Sep 18 |
8. Regular expressions |
|
pp. 63-69 |
6 |
| Sep 21 |
9. Kleene's theorem |
|
pp. 69-76 |
7 |
| Sep 23 |
10. Nonregular languages |
|
pp. 77-83 |
8 |
| Sep 25 |
11. Context free grammars |
Chapter 2 |
pp. 99-105 |
9 |
| Sep 28 |
12. Ambiguity and normal form |
|
pp. 105-109 |
10 |
| Sep 30 |
13. Pushdown automata |
|
pp. 109-114 |
11 |
| Oct 02 |
14. Equivalence of CFGs and PDAs |
|
pp. 115-123 |
12 |
| Oct 05 |
15. Non-context free languages |
|
pp. 123-127 |
13 |
| |
Midterm 1 (October 7–9 in the testing
center) |
| Oct 07 |
16. Review |
|
|
14 |
| Oct 09 |
17. No lecture (Midterm) |
|
|
|
| Oct 12 |
18. Turing machines |
Chapter 3 |
pp. 137-145 |
|
| Oct 14 |
19. Variations on Turing machines |
|
pp. 146-154 |
15 |
| Oct 16 |
20. Algorithms |
|
pp. 154-159 |
16 |
| Oct 19 |
21. Decidable languages |
Chapter 4 |
pp. 165-172 |
17 |
| Oct 21 |
22. Halting problem |
|
pp. 173-179 |
18 |
| Oct 23 |
23. Undecidable and unrecognizable |
|
pp. 179-182 |
19 |
| Oct 26 |
24. Reducibility |
Chapter 5 |
pp. 187-192 |
20 |
| Oct 28 |
25. Reducibility cont. |
|
pp. 192-198 |
21 |
| Oct 30 |
26. Post correspondence problem |
|
pp. 199-205 |
22 |
| Nov 02 |
27. Mapping (many-one) reducibility |
|
pp. 206-210 |
23 |
| Nov 04 |
28. Rice's Theorem |
|
|
24 |
| |
Midterm 2 (November 6–9 in the testing
center) |
| Nov 06 |
29. Review |
|
|
25 |
| Nov 09 |
30. No lecture (Midterm) |
|
|
|
| Nov 11 |
31. Grad School |
|
|
|
| Nov 13 |
32. Big O analysis |
Chapter 7 |
pp. 247-250 |
|
| Nov 16 |
33. Big O analysis cont. |
|
pp. 251-256 |
26 |
| Nov 18 |
34. P |
|
pp. 256-263 |
27 |
| Nov 20 |
35. NP |
|
pp. 264-270 |
28 |
| Nov 23 |
36. NP-complete |
|
pp. 271-276 |
29 |
| Nov 24 |
37. Cook's theorem |
|
pp. 276-283 |
30 |
| Nov 30 |
38. More NP-complete problems |
|
pp. 283-294 |
31 |
| Dec 02 |
39. Approximation and probabilistic algorithms |
Chapter 10 |
pp. 365-370 |
32 |
| Dec 04 |
40. Primality and cryptography |
|
pp. 371-375, 405-411 |
33 |
| Dec 07 |
41. Quantum computing |
|
|
34 |
| Dec 09 |
42. Review |
|
|
|
| Dec 11 |
Reading Day |
|
|
|
| Dec 16 |
Section 2 Final (7:00am–10:00am in
class) |
| Dec 18 |
Section 1 Final (11:00am–2:00pm in
class) |
