|
|
|
|
|
|
SCHEDULE SUBJECT TO CHANGE
* Readings in brackets are for the 5th edition
| Week |
Date |
Content |
Readings* |
Assignments |
| #1 |
January 1 |
HOLIDAY -- NO CLASS |
|
Sleep |
| January 3 |
Administrivia / Propositional Logic |
1.1 |
Assignment 1 out |
| January 4 |
Propositional Equivalences
| 1.2, Supplementary Logic Notes |
|
| January 5 |
Predicates and Quantifiers / Nested Quantifiers |
1.3, 1.4 |
|
| #2 |
January 8 |
Rules of Inference |
1.5 |
|
| January 10 |
Introduction to Proofs |
1.6 [1.5] |
|
| January 12 |
Proof Methods and Strategy / Integers and Division |
1.7, 3.4
[3.1, 2.4] |
Assignment 1 due,
Assignment 2 out
(scan) |
| #3 |
January 15 |
HOLIDAY -- NO CLASS |
|
Perform community service |
| January 17 |
Modular Exponentiation / Primes |
3.6, 3.5
[2.5, 2.4] |
|
| January 19 |
Greatest Common Divisors / Euclid's Algorithm |
3.5, 3.6
[2.4, 2.5] |
|
| #4 |
January 22 |
Applications of Number Theory |
3.7 [2.6] |
Assignment 2 due, Assignment 3 out |
| January 24 |
Mathematical Induction |
4.1 [3.3] |
|
| January 26 |
Strong Induction and Well-Ordering |
4.2 [3.3] |
|
| #5 |
January 29 |
Recursive Definitions and Structural Induction |
4.3 [3.4] |
Assignment 3 due, Assignment 4 out
(#4, #6) |
| January 31 |
Sets / Set Operations |
2.1, 2.2
[1.6, 1.7] |
|
| February 2 |
Functions |
2.3 [1.8] |
|
| #6 |
February 5 |
Counting / Pigeonhole Principle |
5.1, 5.2
[4.1, 4.2] |
Assignment 4 due |
| February 7 |
Permutations and Combinations |
5.3 [4.3] |
|
| February 9 |
Midterm |
|
Assignment 5 out |
| #7 |
February 12 |
Binomial Coefficients, Combinations with Repetition |
5.4 [4.4],
first five pages of 5.5 [4.5] |
|
| February 14 |
Discrete Probability / Probability Theory |
6.1, 6.2
[5.1, 5.2] |
|
| February 16 |
Probability Theory / Bayes' Rule |
6.2 [5.2],
6.3 [*],
Bayes Formula slides
|
Assignment 5 due, Assignment 6 out |
| #8 |
February 19 |
HOLIDAY -- NO CLASS |
|
Sleep |
| February 21 |
Bayes' Rule, Expected Value |
6.3 [*],
6.4 [5.3] |
|
| February 23 |
Linearity of Expectation, Relations |
6.4 [5.3],
8.1 [7.1] |
Assignment 6 due, Assignment 7 out |
| #9 |
February 26 |
Representing Relations / Closure of Relations |
8.3, 8.4
[7.3, 7.4] |
|
| February 28 |
Transitive Closure / Equivalence Relations |
8.4, 8.5
[7.4, 7.5] |
|
| March 2 |
Graphs and Graphs Models / Graph Terminology and Special
Types of Graphs / Graph Isomorphism |
9.1 - 9.4
[8.1 - 8.4] |
Assignment 7 due, Assignment 8 out |
| #10 |
March 5 |
Euler and Hamilton Paths |
9.5, [8.5] |
|
| March 7 |
Planar Graphs / Graph Coloring |
9.7, 9.8
[8.7, 8.8] |
Assignment 8 due |
| March 9 |
Final Review |
|
|
Portions of the CSE 321 Web may be reprinted or adapted for academic
nonprofit purposes, providing the source is accurately quoted and duly
credited. The CSE 321 Web: © 1993-2006, Department of Computer Science
and Engineering, University of Washington.
|
CSE Home
