General Information | Syllabus | HW Assignments |
Lectures | Sections in Text | Brief Description |
---|---|---|
3/29 | 5.1 - 5.3 | Intro to Set Theory: counting, DeMorgan's Law, Venn diagrams |
3/31 | 5.4 - 5.5 | Multiplication principle, tree diagrams, permutations, combinations |
4/2 | 5.6 | Counting Problems |
4/5 | 5.6 - 5.7 | Counting problems, Binomial Theorem |
4/7 | 5.8 | Multinomial coefficients, partitions |
4/9 | Pascal's Identity, generalizing inclusion/exclusion | |
4/12 | 12.1 - 12.3 | Intro to Logic, truth tables, implication |
4/14 | 12.3 - 12.4 | Implication, logical equivalence |
4/16 | Syllogisms | |
4/19 | 12.4 - 12.5 | Logical implication, valid argument |
4/21 | 12.5 and 2.3 | Valid Argument, Arithmetic operations on Matrices |
4/23 | Logic Puzzles | |
4/25 | Review Session, 7-9pm, 104 Bradley | |
4/26 | 13.1 | Graphs as models, degree sequence, isomorphism |
4/27 | Midterm Exam, 7 - 9pm, 101 Bradley | |
4/28 | 13.2 | Paths and ciruits, Eulerian, Hamiltonian |
4/30 | Ramsey Theory | |
5/3 | 13.3, 13.6 | Hamiltonian, Trees, Coloring |
5/5 | 13.4 | Coloring, Digraphs |
5/7 | 13.5 | Matrices and Graphs |
5/10 | 9.1 | Intro to Game Theory |
5/11 (x-hour) | 9.2 | Mixed Strategies |
5/12 | Prisoner's Dilema and other games | |
5/14 | Project proposals due | |
5/14 | NO CLASS | |
5/17 | 9.3 | Optimal mixed strategies |
5/19 | handout | Voting Theory |
5/21 | ||
5/24 | handout | Voting Theory |
5/25 (x-hour) | handout | Voting Theory |
5/26 | Review Problems | |
5/28 | Projects Due | |
5/28 | Wrap up | |
5/31 | No Class | |
6/5 | Final Exam, 8 - 11am |
Erin M. Boyer
Last updated May 31, 2008 12:24:35 EDT