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

Related Areas:

• Information, Data, Network, and Communication Sciences (IDNCS)
• Theory (THY)

Prerequisites: Sophomore mathematical maturity, and programming experience equivalent to that gained with a score of 3 or above on the Advanced Placement Computer Science A exam.

Credit Restrictions: Students will receive no credit for Computer Science 70 after taking Mathematics 55.

Formats:
Summer: 6.0 hours of lecture and 4.0 hours of discussion per week
Spring: 3.0 hours of lecture and 2.0 hours of discussion per week
Fall: 3.0 hours of lecture and 2.0 hours of discussion per week

Grading Basis: letter

Final Exam Status: Written final exam conducted during the scheduled final exam period

---

Class Schedule (Spring 2025):
CS 70 – TuTh 15:30-16:59, Wheeler 150 – Satish B Rao

Class Notes
* Time conflicts are NOT allowed

* Lecture will be recorded for playback later

* NO alternate final exam will be offered

Class Schedule (Fall 2025):
CS 70 – Tu 15:30-16:59, Evans 10; Th 15:30-16:59, Hearst Field Annex A1 – Joshua A Hug, Satish B Rao

Class Notes
* Time conflicts ARE allowed but NO alternate final exam will be offered.

* Lecture will be recorded for playback later.

Class homepage on inst.eecs

Links:

• CS enrollment policies
• EE enrollment policies
• HKN course maps