CS70

CS 70 at UC Berkeley

Discrete Mathematics and Probability Theory

Lectures: Tu/Th 12:30-2 pm, Wheeler 150

Professor Alistair Sinclair

sinclair (at) berkeley (dot) edu

Office Hours: M 1-2 pm, Tu 2:15-3:15 pm, 677 Soda

Professor Yun S. Song

yss (at) berkeley (dot) edu

Office Hours: M 11 am - 12 pm, 629 Soda; Tu 5-6 pm, 304B Stanley Hall

Week 0 Overview

Propositional Logic

Week 1 Overview

Proofs, Induction

Week 2 Overview

Stable Marriage, Graphs

Week 3 Overview

Graphs, Modular Arithmetic

Week 4 Overview

RSA, Polynomials

Week 5 Overview

Midterm, Polynomials

Week 6 Overview

Countability, Computability

Week 7 Overview

Counting, Introduction to Probability

Week 8 Overview

Conditional Probability, Independence

Week 9 Overview

Random Variables, Joint Distributions, Linearity of Expectation, Variance

Week 10 Overview

Applications, Midterm

Week 11 Overview

Inequalities, Geometric, Poisson

Week 12 Overview

Continuous Random Variables

Week 13 Overview

Continuous Random Variables, Markov Chains

Discussions

The discussion sections will not cover new material, but rather will give you additional practice solving problems. You can attend any discussion section you like. However, if there are fewer desks than students, then students will be admitted to the section on a first-come first-served basis and others will have to attend an alternative section. See Policies for more information.

Expand

Homeworks

Homeworks are graded for accuracy and it is highly recommended that you do them. 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.

Expand

Lecture Schedule

  • Lec 1 (8/23): Intro & Propositional Logic (Note 1)
  • Lec 2 (8/28): Proofs (Note 2)
  • Lec 3 (8/30): Induction (Note 3)
  • Lec 4 (9/4): Stable Marriage (Note 4)
  • Lec 5 (9/6): Graph Theory I (Note 5)
  • Lec 6 (9/11): Graph Theory II (Note 5)
  • Lec 7 (9/13): Modular Arithmetic (Note 6)
  • Lec 8 (9/18): RSA (Note 7)
  • Lec 9 (9/20): Polynomials (Note 8)
  • Lec 10 (9/27): Error-Correcting Codes (Note 9)
  • Lec 11 (10/2): Infinity Countability (Note 10)
  • Lec 12 (10/4): Self-Ref and Uncomputability (Note 11)
  • Lec 13 (10/9): Counting (Note 12)
  • Lec 14 (10/4): Introduction to Probability (Note 13)
  • Lec 15 (10/16): Conditional Probability (Note 14)
  • Lec 16 (10/18): Combinations of Events (Note 14)
  • Lec 17 (10/23): Random Variables I (Note 15)
  • Lec 18 (10/25): Random Variables II (Note 16)
  • Lec 19 (10/30): Applications (Note 17)
  • Lec 20 (11/6): Concentration Inequality, LLN (Note 18)
  • Lec 21 (11/8): Geometric and Poisson Dist'n (Note 19)
  • Lec 21 (11/13): Continuous Distributions I (Note 20)
  • Lec 22 (11/15): Continuous Distributions II (Note 20)