DAY  TOPIC  READING  Assign. Out  Assign. In 
M1  Syllabus Distributed Systems Safety and Liveness properties 
1.1 to 1.3 
HW A  
W1  Propositional Logic and its Applications  1.2  HW 1 (1.11.2)  HWA 
F1  Propositional Equivalences  1.3  
M2  Quantifiers  1.4, 1.5  HW1 (new date)  
W2  Rules of Inference  1.6  HW 2 (1.4 and 1.5)  
F2  Proofs and Proof Strategies  1.7, 1.8  
M3  Sets and Set Operations  2.1 and 2.2  HW 3  HW 2 
W3  Cartesian product, Relations, and Functions  2.3 


F3  EXAM 1 (During class time)  
M4  Set
Cardinality Counting Summation and Product notation 
Finish reading Chapter 2  
W4  Sequences  HW 4  HW3  
F4  Finish Chapter
2 Review for Exam 2 (Chapter 2) 

M5 
Algorithms from a mathematical
viewpoint Complexity of algorithms 
3.1, 3.2  HW 5  
W5  Divisibility and Modular Arithmetic  4.1  
F5  No Class  Midquarter Break  HW 4  
M6  Modular arithmetic and Security  slides on moodle


W6  RSA Security  
F6  Exam 2 (Chapters 2 and 3)  


M7  Introduction to Proof by Induction  5.1, 5.2  HW6 Practice 5.1  
W7  Proof by Induction Examples  
F7  Weak/Strong
Induction Wrap up Recursive Structure 
5.3, 5.4  HW 5  
M8  Counting (chapter 6)  6.1, 6.2  HW 7  
W8  Binomial Theorem  6.3, 6.4  HW 6  
F8  Finish Chapter
6 Exam 3 Security and Induction 
6.5  
M9  Recurrence Relations  2.5, 3.2  HW 2.5  
W9  Counting, Inclusion and Exclusion  3.2, 3.3  HW3.2_3.3, PQ 3.2_3.3 
HW 2.4, 
F9  Graphs  5.1  
M11  Final
Exam: MWF 1:20 Monday, 3/19, 6:30pm  9:00 pm 
All work 