CS 280 Fall 2001 Syllabus (subject to change)

We will cover most of chapters 1-9 of Kenneth H. Rosen,Discrete Mathematics and Its Applications (4th edition) , plus perhaps some supplementary material as time permits.  Here is the preliminary schedule through prelim 1:

Date Topic Reading
8/31 Propositional logic  1.1, 1.2
9/3 Predicates and quantifiers 1.3
9/5 Sets and set operations 1.4, 1.5
9/7 Functions 1.6
9/10 Sequences 1.7
9/12 Comparing functions 1.8
9/14 Algorithms and complexity 2.1, 2.2
9/17 Division of integers 2.3
9/19 Different bases 2.4
9/21 Arithmetic in CS 2.5
9/24 Matrices 2.6
9/26 Proofs 3.1
9/28 Induction 3.2
10/1 Recursive definitions 3.3
10/3 Recursive algorithms 3.4
10/5 Program correctness 3.5
10/8 Fall break
10/10 Counting, pigeonhole principle  4.1, 4.2
10/12 Permutations and combinations         4.3
10/15 Review
10/16      Prelim 1
10/17 Classical probability 4.4
10/19 Probability II 4.5
10/22 Probability III 4.5
10/24 Permutations and combinations II 4.6, 4.7
10/26 Recurrence relations 5.1, 5.2
10/29 Inclusion-exclusion 5.5, 5.6
10/31 Goblins and other Relations 6.1, 6.2
11/2 More relations 6.3, 6.4
11/5 Equivalence relations, partial orderings 6.5, 6.6
11/7 Graphs 7.1, 7.2
11/9 Graphs and isomorphisms 7.2, 7.3
11/12 Review
11/13 Prelim 2
11/14 Graph connectivity and paths 7.4, 7.5
11/16 Graph paths and planarity 7.6, 7.7
11/19 Graph structure in the web
11/21 Thanksgiving break
11/26 Planarity and graph coloring 7.7, 7.8
11/28 Trees and applications 8.1, 8.2
11/30 Tree traversal and sorting 8.3, 8.4
12/3 Boolean functions 9.1, 9.2
12/5 Logic gates 9.3, 9.4
12/7 Data mining