|
| CMPSCI 250: Office Hours, Spring 2013 | |
| David Mix Barrington, CompSci Bldg 210 | Mon 11-12, Tue 11-12, Wed 2:30-3:30, Thu 3-4, and by appt. |
| Melissa Frechette, LGRT 220 | M 4-30-5:30 |
| Girish Paladugu, LGRT 220 | Tu 4-5 |
| Cibele Freire, LGRT 220 | W 4-5 |
| Tung Pham, DuBois Lib. 1349 | T 4 - 5:15, Th 8:30 - 9:45 |
| Date | Lecture | Readings from text to be completed by midnight before class |
|---|---|---|
| Tu, 1/22 | 1. Introduction: PropCalc | R1: 1.1, 1.2 (1.1 of 6th edition) |
| Th, 1/24 | 2. Propositional Equivalences | R2: 1.3 (1.2 of 6th edition) |
| M, 1/28 | D1. Working with PropCalc | |
| Tu, 1/29 | 3. Sets and Functions | R3: 2.1 - 2.2 (2.1, 2.2 of 6th edition) |
| Th, 1/31 | 4. Cardinality of Infinite Sets | R4: 2.3, 2.5 (2.3 of 6th edition) |
| M, 2/4 | D2. Cardinality, Sets and Functions | |
| Tu, 2/5 | 5. Modular Arithmetic | R5: 4.1, 4.2 (3.4, 3.5 of 6th edition) |
| Th, 2/7 | 6. Euclid's Algorithm | R6: 4.3 (3.6 of 6th edition) |
| M, 2/11 | D3. Orders of Elements mod m | |
| Tu, 2/12 | 7. Chinese Remainder Theorem | R7: 4.4, (3.7 of 6th edition) |
| Th, 2/14 | 8. Euler's Phi Function and Cryptography | |
| Tu, 2/19 | D4: review for first midterm | |
| Th, 2/21 | no class: First Evening Test | 7:15 - 8:45 p.m., Goessmann 64 |
| M, 2/25 | D5. A Murder Mystery | |
| Tu, 2/26 | 9. Predicates and Quantifiers | R9: 1.4, 1.5 (1.3, 1.4 of 6th edition) |
| Th, 2/28 | 10. Rules of Inference | R10: 1.6 (1.5 of 6th edition) |
| M, 3/4 | D6. The Truth Game | |
| Tu, 3/5 | 11. Proofs and Proof Methods | R11: 1.7, 1.8 (1.6, 1.7 of 6th edition) |
| Th, 3/7 | 12. Mathematical Induction | R12: 5.1 (4.1 of 6th edition) |
| M, 3/11 | D7. Writing Induction Proofs | |
| Tu, 3/12 | 13. More Mathematical Induction | R13: 5.2 (4.2 of 6th edition) |
| Th, 3/14 | 14. Induction and Recursion | R14: 5.3 (4.3 of 6th edition) |
| 3/18 | Spring Break | 3/22 |
| M, 3/25 | D8. Boolean Expression Trees | |
| Tu, 3/26 | 15. Graphs | R15: 10.1, 10.2, 10.3 (9.1, 9.2, 9.3 of 6th edition) |
| Th, 3/28 | 16. Paths and Connectivity in Graphs and Digraphs | R16: 10.4 (9.4 of 6th edition) |
| M, 4/1 | D9. Finding Shortest Paths With Matrices | |
| Tu, 4/2 | 17. Trees and Acyclic Graphs | R17: 11.1, 11.2 (?? of 6th edition) |
| Th, 4/4 | no class: Second Evening Test | 7:00 - 9:00 p.m., Goessman 51 and 64 |
| M, 4/8 | D10. Uniform-Cost Search | |
| Tu, 4/9 | 18. Searching on Graphs | R18: 10.6, 11.4 (??, ?? of 6th edition) |
| Th, 4/11 | 19. Regular Expressions and Their Languages | R19: Rosen 13.4 (pp. 878-880), Barrington 5.1, 5.2 |
| Tu, 4/16 | 20. DFA's, Their Languages, and NFA's | R20: Rosen 13.3, Barrington 14.1, 14.5 |
| W, 4/17 | D11. Designing Regular Expressions | |
| Th, 4/18 | 21. Non-Regular Languages and the Myhill-Nerode Theorem | R21: Barrington 14.2, 14.3 |
| M, 4/22 | D12. Minimizing DFA's | |
| Tu, 4/23 | 22. NFA's, λ-NFA's, and DFA's | R22: Barrington 14.6, 14.7 |
| Th, 4/25 | 23. Finishing Kleene's Theorem | R23: Rosen 13.4, Barrington 14.8, 14.10 |
| M, 4/29 | D13. Course Evaluations | |
| Tu,4/30 | 24. Summary and Review | |
| Th, 5/9 | Final Exam in Marcus 131, 8:00-10:00 am |