CS 70. Discrete Mathematics and Probability Theory Catalog Description: Logic, infinity, and induction; applications include undecidability and stable marriage problem. Modular arithmetic and GCDs; applications include primality testing and cryptography. Polynomials; examples include error correcting codes and interpolation. Probability including sample spaces, independence, random variables, law of large numbers; examples include load balancing, existence arguments, Bayesian inference.
thecuongthehieu / cs70-discrete-mathematics-and-probability-theory Goto Github PK
View Code? Open in Web Editor NEWCS70: Discrete Mathematics and Probability Theory