Instructor:
TA:
Time:
Location:
Objectives:
Lecture content:
2. Topics in enumeration
3. Graph theory and applications
Lecture syllabus:
| Lecture | Date | Subject | Note |
| 1 | 2/21 | Fundamental principles of counting, fundamentals of logic, set theory | |
| 2 | 2/28 | 228, no class | |
| 3 | 3/7 | Properties of the integers: mathematical induction | |
| 4 | 3/14 | Relations and functions | Quiz 1 |
| 5 | 3/21 | Relations and functions | |
| 6 | 3/28 | Languages: finite state machines | |
| 7 | 4/4 | Relations: the second time around | Quiz 2 |
| 8 | 4/11 | Relations: the second time around | |
| 9 | 4/18 | Midterm exam | |
| 10 | 4/25 | The principle of inclusion and exclusion | |
| 11 | 5/2 | The principle of inclusion and exclusion | |
| 12 | 5/9 | Generating functions | |
| 13 | 5/16 | Generating functions | |
| 14 | 5/23 | Recurrence relations | Quiz3 (delayed) |
| 15 | 5/30 | Recurrence relations | |
| 16 | 6/6 | An introduction to graph theory | |
| 17 | 6/13 | An introduction to graph theory | |
| 18 | 6/20 | Final exam |
Grade:
Textbook: