| # |
Week |
Tuesday |
Thursday |
due |
| 1 |
Jan 21 - 25 |
Number Systems 1.1, 1.2 |
Induction 1.3, Algorithms 1.4 |
|
| 2 |
Jan 28 - Febr 1 |
Propositional Logic 2.1, 2.2 |
Predicate Logic 2.3, Quiz # 1 |
Homework 1 |
| 3 |
Febr 4 - 8 |
Sets, Relations 3.1 |
Matrices of Relations (Handout) |
|
| |
|
Functions 3.2 |
Equivalence Relations 3.3, Quiz # 2 |
Homework 2 |
| 4 |
Febr 11 - 15 |
Counting Principles 5.1 |
Counting (Handout) |
|
| |
|
|
Probability 5.3, Quiz # 3 |
Project 1 |
| 5 |
Febr 18 - 22 |
Recurrence Equations 5.5 |
Recurrence Equations 5.5, Quiz # 4 |
Homework 3 |
| 6 |
Febr 25 - March 1 |
Partially ordered sets 6.1 |
Trees 6.2, Quiz # 5 |
Project 2 |
| 7 |
March 4 - 8 |
Review |
Midterm exam |
Homework 4 |
| 8 |
Spring Recess |
- |
- |
| 9 |
March 18 - 22 |
Trees 6.2 |
Minimum spanning trees (handout) |
|
| |
|
Huffman codes 11.3 |
Boolean Algebras 6.3, Quiz # 6 |
Project 3 |
| 10 |
March 25 - 29 |
Graphs 8.1 |
Transitive Closue |
|
| |
|
|
& Connectedness 8.3, Quiz # 7 |
Homework 5 |
| 11 |
April 1 - 5 |
Eulerian & Hamiltonian |
Rates of growth 10.1, |
|
| |
|
circuits 8.4 |
Quiz # 8 |
Project 4 |
| 12 |
April 8 - 12 |
Algorithms 10.2 |
Sorting & Searching 10.3, Quiz # 9 |
Homework 6 |
| 13 |
April 15 - 19 |
Shortest Paths |
NP-completeness 10.4 |
|
| |
|
(handout) |
RSA (handout), Quiz # 10 |
Project 5 |
| 14 |
April 22 - 26 |
Networks, Max Flow (handout) |
?, Quiz # 11 |
Homework 7 |
| 15 |
April 29 - May 3 |
? |
Review |
Project 6 |
| 16 |
Exam Week |
- |
- |
