CS 70 at UC Berkeley
Discrete Mathematics and Probability Theory
Lecture: TuTh 3:30-5:00pm, Wheeler 150
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.
- Note 0: Review of Sets, Notation
- Note 1: Propositional Logic
- Note 2: Proofs
- Note 3: Induction
- Note 4: Stable Marriage
- Note 5: Graph Theory
- Note 6: Modular Arithmetic
The discussion sections are specifically designed to consolidate the material covered in lectures and in the notes. It is highly recommended that you attend both discussions each week. You may attend any discussion section, but we recommend that you settle on a weekly two-section pair (with the same TA) as early as possible in the semester. If a particular section is too full, then students will be admitted on a first-come first-served basis and others will have to attend an alternative section. All sections are equivalent: they all cover the same material. See Policies for more information.
- Discussion 1: Propositional Logic, Proofs (solution)
- Discussion 1b: Quiz (Logic, Proofs) (solution)
- Discussion 2: Induction, Stable Marriage (solution)
- Discussion 2b: Quiz (Induction, Stable Marriage) (solution)
- Discussion 3: Graph Theory (solution)
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 these drops 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.
- HW 00: Course Logistics (TeX) (Sol)
- HW 1: Propositional Logic, Proofs (TeX) (Sol)
- HW 2: Induction, Stable Marriage (TeX) (Sol)
- HW 3: Graph Theory (TeX)