COMPSCI 70
Discrete Mathematics and Probability Theory
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.
Prerequisites & course information
{'preRequisiteCourse': '1043771', 'concurrentPrerequisit': False}
Sources
- Course catalogue ↗2026-2027