Week Lec Day Date Topic Reading 7e Homework Released Homework Due

1 Tue 4-Sep Introduction to Course, Propositional Logic 1.1

1 2 Thu 6-Sep Propositional Equivalences 1.2, 1.3 HW 1
3 Tue 11-Sep Predicates and Quantifiers 1.4, 1.5
2 4 Thu 13-Sep Introduction to proofs 1.6, 1.7 HW 2 HW 1
5 Tue 18-Sep Proof Methods and Strategy 1.8
3 6 Thu 20-Sep Sets, Set Operations 2.1, 2.2 HW 3 HW 2
7 Tue 25-Sep Functions 2.3
4 8 Thu 27-Sep Sequences and Summations 2.4, 2.5 HW 4 HW 3
9 Tue 2-Oct Mathematical Induction 5.1
5 10 Thu 4-Oct Strong Induction and Well-ordering 5.2 HW 5 HW 4
11 Tue 9-Oct Basics of Counting, Pigeonhole Principle 6.1, 6.2
Tue 9-Oct Midterm 1 (7:30-9:30pm) (covers sections 1.1-1.8, 2.1-2.5; Including HWs 1-4)
6 12 Thu 11-Oct Permutations and Combinations, Binomial Coefficients 6.3, 6.4 HW 6 HW 5
15,16 Oct Fall Break!!
7 13 Thu 18-Oct Binomial Coefficients, Generalized Permutations and Combinations 6.4, 6.5 HW 7 HW 6
14 Tue 23-Oct Discrete probability 7.1, 7.2
8 15 Thu 25-Oct Bayes' Theorem 7.3 HW 8 HW 7
16 Tue 30-Oct Expectation and Variance 7.4
9 17 Thu 1-Nov Relations and their properties 9.1, 9.2 HW 9 HW 8
18 Tue 6-Nov Representing relations, Closures 9.3, 9.4
10 19 Thu 8-Nov Equivalence Relations, Partial Orderings 9.5, 9.6 HW 10 HW 9
20 Tue 13-Nov Graphs, Graph Terminology 10.1, 10.2
Tue 13-Nov Midterm 2 (7:30-9:30pm) (covers sections 5.1, 5,2,6.1-6.5, 7.1-7.4, 9.1-9.2; Including HWs 4-9)
11 21 Thu 15-Nov Algorithms 3.1 HW 11 HW 10
12 22 Tue 20-Nov Growth of Functions, Complexity of Algorithms 3.2, 3.3
22-26 Nov Thanksgiving break!!! No Discussion 12
23 Tue 27-Nov Recurrence (solving linear recurrences) 8.1, 8.2
13 24 Thu 29-Nov Divide-and-conquer algorithms and recurrence relations 8.3 HW 12 HW 11
25 Tue 4-Dec Divisibility and Modular Arithmetic 4.1, 4.2
14 26 Thu 6-Dec Prime numbers and Congruences 4.3, 4.4 HW 13 (ungraded) HW 12
15 27 Tue 11-Dec Cryptography 4.6
Tue 18-Dec Final exam (7-9 pm) (comprehensive)