meeting 
date 


1 
May 20 
course introduction logic (1.1)
propositional equivalences (1.2) 
exercises 
2 
May 27 
predicates and quantifiers (1.3)sets
(1.4)set operations (1.5)functions (1.6) sequences and
summations (1.7) 
homework #1 
3 
June 3 
the growth of functions (1.8)algorithms
(2.1)complexity of algorithms (2.2)integers and division
(2.3)integers and algorithms (2.4)applications of number theory
(2.5)matrices (2.6) 
homework #2 
4 
June 10 
methods of proof (3.1)mathematical induction
(3.2) 
homework #3 
5 
June 17 
recursive definitions (3.3)recursive algorithms (3.4)program
correctness(3.5) the basics of counting (4.1)the pigeonhole principle (4.2)permutations and
combinations (4.3) 
homework #4 
6 
June 24 
discrete probability (4.4)probability theory (4.5)generalized perm's and comb's
(4.6)generating perm's and comb's (4.7)midterm quiz 
homework
#5 
7 
July 1 
recurrence relations (5.1)solving recurrence relations (5.2)divideandconquer
(5.3)generating functions (5.4)inclusionexclusion (5.5)app's of inclusionexclusion
(5.6) 
homework
#6 
8 
July 8 
relations (6) 
homework #7 
9 
July 15 
graphs (7) 
homework #8 
10 
July 22 
trees (8) 
homework #9 
11 
July 29 


12 
August 5 

