Below is the current calendar for the CSE321 class. Please keep in mind that Dieter is constantly updating this. It should accurately describe the past, but it won't always accurately predict the future. Links to lecture notes are included as they become available.

Monday Wednesday Friday
1/5
Administrative details
Propositional logic
Read: Rosen 1.1
1/7
Propositional logic
Logical equivalence
Read: Rosen 1.2
1/9
Logical equivalence
Quantifiers
Read: Rosen 1.3
1/12
Nested Quantifiers
Read: Rosen 1.4
1/14
Rules of inference
Read: Rosen 1.5
Slides on logic
1/16
Proofs
Read: Rosen 1.6
Logic handout
1/19
No class, MLK day
1/21
Proofs, sets
Read: Rosen 1.7, 2.1
Slides on sets
1/23
Sets, functions
Read: Rosen 2.2, 2.3
Slides on functions
1/26
Integers and division
Read: Rosen 3.4
Slides on integers
1/28
Primes and GCD
Read: Rosen 3.5, 3.6
1/30
RSA encryption
Read: Rosen 3.7
2/2
Mathematical induction
Read: Rosen 4.1
2/4
Strong induction
Read: Rosen 4.2
2/6
Recursive definitions, structural induction
Read: Rosen 4.3
2/9
Counting
Read: Rosen 5.1
Slides on counting
2/11
Pigeonhole principle, combinations, permutations
Read: Rosen 5.2, 5.3
2/13
Midterm
2/16
Binomial coefficients
Read: Rosen 5.4
2/18
Discrete probability
Read: Rosen 6.1
Slides on probability
2/20
Probability theory
Read: Rosen 6.2
2/23
Expected value
Read: Rosen 6.2, 6.4
2/25
Bayes' theorem, variance
Read: Rosen 6.3, 6.4
2/27
Probabilistic robotics
3/2
Relations
Read: Rosen 8.1, 8.3
Slides on relations
3/4
Closures of relations
Read: Rosen 8.4
3/6
Equivalence relations, graphs
Read: Rosen 8.5, 9.1
3/2
Bipartite graphs, graph isomorphism
Read: Rosen 9,2 - 9.5
Slides on graphs
3/4
Isomorphism, Euler circuits
Read: Rosen 8.4
3/13
Review

Midterm exam Friday, February 13, 1:30-2:20 pm

Final exam Monday, March 16, 2:30-4:20 pm


Dieter Fox
Last modified: Wed Jan 7 09:17:08 PDT 2009