datamap Courses Projects Support

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.

Details

  • Department: Computer Science (COMPSCI)
  • Units: 4
  • Prerequisites: Sophomore mathematical maturity
  • Tools: LaTeX
  • Cluster(s): Computer Science
  • Tags: Foundational