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.

Units: 4

Also Offered As: COMPSCI 70

Prerequisites: Sophomore mathematical maturity, and programming experience equivalent to that gained in 3 or the Advanced Placement Computer Science A course.

Grading Basis: Student Option

Final Exam Status: Yes

---

Class Schedule (Spring 2026):
CS 70 – TuTh 12:30-13:59, Dwinelle 155 – Alistair J Sinclair, Yun S. Song

Class Notes
- Time conflicts are not allowed

- Lectures will be recorded. We may stop webcasting if the enrollment number falls below the room capacity.

Class Schedule (Fall 2026):
CS 70 – TuTh 15:30-16:59, Li Ka Shing 245 – Joshua A Hug, Manuel A Sabin

Class Notes
- Lectures will be recorded

- Seats reserved for students with enrollment permission are not open. They are reserved for students in internal programs. Please DO NOT ask faculty or staff for one of these seats.

Links:

• EECS Course Archives (CalNet authentication required)
• CS enrollment policies
• EE enrollment policies
• HKN course maps