CS 70 at UC Berkeley

Discrete Mathematics and Probability Theory

Lecture: TTh 8-9:30am, Zoom

Professor Satish Rao

satishr (at) cs (dot) berkeley (dot) edu

Office Hours: Monday 3-4 (See piazza @443 for zoom link.) And by appointment.

Week 0 Overview

Propositional Logic

Week 1 Overview

Proofs, Induction

Week 2 Overview

Stable Matching

Week 3 Overview

Graphs, Modular Arithmetic

Week 4 Overview

Modular Arithmetic, Public Key Cryptography

Week 5 Overview

Polynomials and Error-Correcting Codes

Week 6 Overview


Week 7 Overview

Midterm, Countability


There is no textbook for this class. Instead, there is a set of comprehensive lecture notes. Make sure you revisit the notes after every lecture, and multiple times thereafter: you should be aware that it will likely take several readings before you fully understand the material. Each note may be covered in one or more lectures. See Policies for more information.



Discussions will be held over Zoom. The discussion sections are specifically designed to consolidate the material covered in lectures and in the notes. It is highly recommended that you attend all discussions each week. You should attend the discussion that you signed up for, since attendance for that discussion will be graded. All sections are equivalent: they all cover the same material. See Policies for more information.



There will be weekly required homeworks, again designed to consolidate your understanding of the course material. It is highly recommended that you attempt all homeworks. Your lowest two homework scores will be dropped, but this drop should be reserved for emergencies. No additional allowances will be made for late or missed homeworks: please do not contact us about missed homeworks or late submissions. See Policies for more information.


(Tentative) Lecture Schedule