EECS 47F. Completion of work in Computer Science 70
Catalog Description: This course allows students who have had a discrete math and/or probability course to complete the work in CS70. 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: Sophomore mathematical maturity, programming experience equivalent to that gained in COMPSCI 61A, a prior college level course on discrete math and/or probability, and consent of the instructor.
Spring: 3.0-8.0 hours of self-paced per week
Summer: 6.0-16.0 hours of self-paced per week
Fall: 3.0-8.0 hours of self-paced per week
Grading basis: letter
Final exam status: Written final exam conducted during the scheduled final exam period