(This schedule is tentative and may change slightly as the course progresses.)
| Day | Date | Topic(s) | Section of Book (Homework Problems) |
| Mon | Sep 5 | NO CLASS - LABOR DAY | |
| Wed | Sep 7 | Introduction Sets and Subsets Operations on Sets |
1.1 (HW: # 1-17 odd) 1.2 (HW: # 1-19 odd) |
| THU | Sep 8 | LAST DAY TO DROP A CLASS WITHOUT RECEIVING A "W" |
|
| FRI | Sep 9 | LAST DAY TO ADD A CLASS | |
| Mon | Sep 12 | Sequences Division in the Integers |
1.3 (HW: # 1-21 odd, 39) 1.4 (HW: # 1-21 odd, 39, 41) |
| Wed | Sep 14 | The Euclidean Algorithm Matrices Quiz 1 |
1.4 1.5 (HW: # 1-13 odd, 31, 33) 1.1 - 1.4 |
| Mon | Sep 19 | Matrices Mathematical Structures |
1.5 1.6 (HW: # 1-23 odd) |
| Wed | Sep 21 | Mathematical Induction Quiz 2 |
2.4 (HW: # 1-13 odd, 17, 21, 23, 27) 1.5, 1.6 |
| Mon | Sep 26 | Permutations Combinations |
3.1 (HW: # 1-15 odd) 3.2 (HW: # 1-15 odd) |
| Wed | Sep 28 | Elements of Probabability Recurrence Relations Quiz 3 |
3.4 (HW: # 1-15 odd, 31-35 odd) 3.5 (HW: # 1-17 odd) 2.4, 3.1, 3.2 |
| Mon | Oct 3 | Product Sets and Partitions Relations and Digraphs |
4.1 (HW: # 1-17 odd) 4.2 (HW: # 1-25 odd) |
| Wed | Oct 5 | Paths in Relations and Digraphs Properties of Relations |
4.3 (HW: # 1-19 odd, 27) 4.4 (HW: # 1-25 odd) |
| Mon | Oct 10 | Equivalence Relations Computer Representations of Relations and Digraphs Quiz 4 |
4.5 (HW: # 1-13 odd) 4.6 (HW: # 5-9 odd) 3.4, 3.5, 4.1 - 4.4 |
| Wed | Oct 12 | Operations on Relations Transitive Closure and Warshall's Algorithm Review for Exam 1 |
4.7 (HW: # 1-23 odd) 4.8 (HW: # 1-15 odd) - |
| MON | Oct 17 | EXAM 1 | On the material covered to date |
| Wed | Oct 19 | Functions | 5.1 (HW: # 1-17 odd) |
| Mon | Oct 24 | Functions for Computer Science Growth of Functions Quiz 5 |
5.2 (HW: # 1-11 odd) 5.3 (HW: # 1-21 odd) 4.5 - 4.8, 5.1 |
| Wed | Oct 26 | Partially Ordered Sets | 6.1 (HW: # 1-17 odd) |
| Mon | Oct 31 | Extremal Elements of Partially Ordered Sets
Quiz 6 |
6.2 (HW: # 1-17 odd, 21-33 odd) 5.2, 5.3, 6.1 |
| Wed | Nov 2 | Lattices | 6.3 (HW: # 1-7 odd, 17) |
| THU | Nov 3 | LAST DAY TO DROP A CLASS AND RECEIVE A "W" |
|
| Mon | Nov 7 | Finite Boolean Algebras Quiz 7 |
6.4 (HW: # 1-11 odd, 23-31 odd) 6.2, 6.3 |
| Wed | Nov 9 | Functions on Boolean Algebras Circuit Designs |
6.5 (HW: # 1-9 odd) 6.6 (HW: # 1-23 odd) |
| Mon | Nov 14 | Trees Quiz 8 |
7.1 (HW: # 1-21 odd) 6.4 - 6.6 |
| Wed | Nov 16 | Labeled Trees Review for Exam 2 |
7.2 (HW: # 1-19 odd) - |
| MON | Nov 21 | EXAM 2 | On the material covered since Exam 1 |
| TUE | Nov 22 | Tree Searching | 7.3 (HW: # 1-19 odd) |
| Wed | Nov 23 | NO CLASS - THANKSGIVING BREAK | |
| Mon | Nov 28 | Languages Quiz 9 |
10.1 (HW: # 1-25 odd) 7.1 - 7.3 |
| Wed | Nov 30 | Representation of Special Grammars Regular Expressions |
10.2 (HW: 1-19 odd) 1.3 (HW: 31,33,35) |
| Mon | Dec 5 | Finite-State Machines Monoids, Machines and Languages Quiz 10 |
10.3 (HW 1-15 odd) 10.4 (HW: 1-19 odd) 1.3, 10.1, 10.2 |
| Wed | Dec 7 | Machines and Regular Languages | 10.5 (HW: 1-23 odd) |
| Mon | Dec 12 | Review for the Final Exam Quiz 11 |
- 10.3 - 10.5 |
| WED | Dec 21 | FINAL EXAM, 8:30-11:30am | The final is comprehensive, but will emphasize the material since Exam 2 |