|
Apr 25, 2024
|
|
|
|
CS 250 - Discrete Mathematics for Computer Science 3 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. Prerequisite(s): CS 161 grade of C or higher.
Add to Portfolio (opens a new window)
|
|