The following schedule is tentative and is subject to change as the semester proceeds. After each class, I'll link each title to a brief set notes for that class in PDF format. Remember that the summer session condenses a full 3-point class into 6 weeks, so this schedule will be fairly intense by definition. Homework solutions are available by clicking the "Due" link.
| # | Date | Topic | Reading Due | HW |
|---|---|---|---|---|
| 1 | 5/24 | Course intro; Propositions, truth tables, quantifiers | Ch. 1.1-1.4 | |
| 2 | 5/26 | Methods of proof, sets and functions | Ch. 1.5-1.8 | |
| * | 5/31 | Memorial Day holiday | HW#1: 1.1.10, 1.2.10, 1.3.22, 1.4.16, 1.5.12, 1.6.18, 1.7.14, 1.8.14 | |
| 3 | 6/2 | Algorithms, growth; integers and integer algorithms | Ch. 2.1-2.5 | |
| 4 | 6/7 | Reasoning, induction, recursion | Ch. 3.1-3.5 | HW#1 due; HW#2: 2.1.32, 2.2.32, 2.3.12, 2.5.22, 3.1.6, 3.2.18, 3.3.18, 3.4.24 |
| 5 | 6/9 | Counting, pigeonhole principle, permutations/combinations, binomial coefficients | Ch. 4.1-4.5 | |
| 6 | 6/14 | Discrete probability | Ch. 5.1-5.2 | HW#2 due; HW#3: 3.5.4, 4.1.22, 4.2.16, 4.3.18, 4.4.8, 4.5.10, 4.5.32, 5.1.14 |
| Midterm (covering #1-5) | ||||
| 7 | 6/16 | Recurrence relations, divide-and-conquer, relations | Ch. 6.1-6.3, 7.1 | |
| 8 | 6/21 | Relations | Ch. 7.2-7.4 | HW#3 due; HW#4: 5.2.10, 5.2.20, 6.1.8, 6.2.4, 6.3.10, 7.1.32, 7.3.32, 7.5.20 |
| 9 | 6/23 | Equivalence relations and partial orderings; Graphs and their representation | Ch. 7.5-7.6, 8.1-8.2 | |
| 10 | 6/28 | Graphs: paths/connectivity/traversability, layouts | Ch. 8.3-8.7 | HW#4 due; HW#5: 7.6.26, 8.3.44, 8.5.34, 8.7.6 |
| 11 | 6/30 | Graph colorings; Trees: intro, tree traversal, spanning trees | Ch. 8.8, 9.1-9.5 | |
| Final exam (covering #6-10) | ||||
| * | 7/2 | HW#5 due at 5:30PM in 608 CEPSR | ||