everything.study
COMPSCI 174

Combinatorics and Discrete Probability

4 credits · Undergraduate

Permutations, combinations, principle of inclusion and exclusion, generating functions, Ramsey theory. Expectation and variance, Chebychev's inequality, Chernov bounds. Birthday paradox, coupon collector's problem, Markov chains and entropy computations, universal hashing, random number generation, random graphs and probabilistic existence bounds.

Prerequisites & course information

{'preRequisiteCourse': '1042811', 'concurrentPrerequisit': False}

Sources