Home Bookmarks Papers Blog

273


Exams: Midterm I, Midterm II, Final.
Homeworks: 0, 1, 2, 3, 4, 5, 6.

Class notes

    1. Introduction; Basic counting rules
    2. Permutations, combinations, balls in boxes
    3. Partitions, Pascal's formula, binomial thm., multinomial thm.
    4. Newton's binomial thm., inclusion/exclusion
    5. Pigeonhole principle, Erdos-Szekeres thm
    6. Probability spaces, conditional probability
    7. Independence, Binomial distribution
    8. Linearity of expectation, indicator variables, Markov's inequality
    9. Recurrences: examples, annihilators
    10. Recurrences: more annihilators
    11. Recurrences: divide and conquer
    12. Recurrences: divide and conquer, other techniques
    13. Graph theory: Platonic Solids
    14. Problem Session
    15. Approximations of various coefficients and Ramsey Theory
    16. Theory of Computation: cardinality of sets

Sariel Har-Peled
CS 273, Spring 2004
11:00-12:15 TuTh,
DCL 1320

TAs

Vivek Pandey
Jin-Yeop Chang
Last modified: Fri Jul 15 16:33:04 CDT 2005