Notes:
- All assignments are due when they are listed on their document (unless prior approval has been received). Q is for quizzes, HW for regular homeworks, and P for projects.
- Reading assignments are from Discrete Mathematics With Applications, 5th Ed. by Epp; They are strongly encouraged but you are welcome to read any text that helps you. You are expected to have some understanding of the linked questions for that day.
| Week | Lecture | Date | Due | Reading | Topic |
|---|---|---|---|---|---|
| 1 | 1 | 06.03 | Q | 2.1,2.2 | Class logistics and goals, logical forms and statements [notes/slides] |
| 2 | 06.04 | 2.3,2.4 | Arguments and digitial logic circuits [notes/slides] | ||
| 3 | 06.05 | 3.1,3.2 | Quantified Logic [notes] | ||
| 4 | 06.06 | Q | 3.3,3.4 | Multiple Quantifiers and arguments [notes] | |
| 2 | 5 | 06.10 | HW/P | 4.1 | Proof intro, writing, guide [notes] |
| 6 | 06.11 | Q | 4.2, 4.3 | Induction [notes] | |
| 7 | 06.12 | 4.4,4.5,4.6 | More induction! some intro to trees, sequences, and sets [notes] | ||
| 8 | 06.13 | 4.5,4.6,4.7 | Proof practice, sequences, and sets [notes] | ||
| 06.14 | Q | ||||
| 3 | 9 | 06.17 | HW | 5.1, 5.6, 5.6, 5.8, 5.9 | More Sequences and algorithm correctness [notes |
| 10 | 06.18 | Q | 6.1, 6.2, 6.3, 6.4 | Set theory [notes] | |
| 11 | 06.19 | 7.1, 7.2, 7.3 | Functions [notes] | ||
| 12 | 06.20 | 7.4 | Computability and practice day [notes] | ||
| 06.21 | Q | ||||
| 4 | 13 | 06.24 | HW/P | 11.1, 11.2 | Algorithm Analysis [notes] |
| 14 | 06.25 | 11.3, 11.4 | More algorithm analysis [notes] | ||
| 15 | 06.26 | 11.5 | Graph theory ideas [notes] | ||
| 16 | 06.27 | Review day for questions and activity [notes] | |||
| 06.28 | MIDTERM 12-1:50pm in RAMY N1B23 | ||||
| 5 | 17 | 07.01 | Exam | 8.1, 8.2 | Cryptography and Modular arithmetic [notes] |
| 18 | 07.02 | Q | 8.3, 8.4 | Equivalence relations and modular arithmetic | |
| 19 | 07.03 | 8.5 | Number theory and partial ordering | ||
| 07.04 | Happy July 4th! No class | ||||
| 07.05 | |||||
| 6 | 20 | 07.08 | 9.1, 9.2, 9.3, 9.4 | ||
| 21 | 07.09 | Q/HW | 9.5, 9.6, 9.7 | ||
| 22 | 07.10 | 9.8, 9.9 | Warm-up problems | ||
| 23 | 07.11 | review, catch-up, and ML | markov chains/huffman encoding | ||
| 07.12 | Q | ||||
| 7 | 24 | 07.15 | P/HW | 1.4, 4.9, 10.1, 10.2 | |
| 25 | 07.16 | 10.3 | Tours [notes] | ||
| 26 | 07.17 | 10.4, 10.5 | Graph coloring [notes] Brooks' theorem/five-color-theorem | ||
| 27 | 07.18 | 10.6 | isomporphisms and spanning trees | ||
| 07.19 | Q | ||||
| 8 | 28 | 07.22 | HW | 12.1 | |
| 29 | 07.23 | 12.2 | |||
| 30 | 07.24 | Review day | |||
| 31 | 07.25 | 12.3 | |||
| 07.26 | bonus/reading that helps with bonus | Final exam 12-1:50pm in DUAN G125 |