Spring 2017 CS70 at UC Berkeley

# Discrete Mathematics and Probability Theory

Lectures: TTh 12:30 - 2:00 p.m., Pauley Ballroom

## Professor Satish Rao

satishr@eecs (dot) berkeley (dot) edu

Office Hours: M 11-12 p.m., T 4-5 p.m. in Soda 687

### Week 0 Overview

## Propositional Logic and Proofs

### Week 1 Overview

## Proofs, Induction

### Week 2 Overview

## Stable Marriage, Graph Theory

### Week 3 Overview

## Modular Arithmetic, Bijections

### Week 4 Overview

## RSA, Polynomials

### Week 5 Overview

## Error Correcting Codes

## Notes

There is no textbook for this class. Instead, there is a set of fairly comprehensive lecture notes. Make sure you revisit the notes after lecture. Each note may be covered in one or more lectures. See Syllabus 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
- Note 7: Bijections and RSA
- Note 8: Polynomials
- Note 9: Error Correcting Codes
- Note 10: Infinity and Uncountability
- Note 11: Self-Reference and Uncomputability
- Note 12: Counting
- Note 13: Introduction to Discrete Probability
- Note 14: Conditional Probability
- Note 15: Two Killer Applications
- Note 16: Random Variables: Distribution and Expectation
- Note 17: Variance
- Note 18: Chebyshev's Inequality
- Note 19: Some Important Distributions
- Note 20: Continuous Probability
- Note 24: Markov Chains
- Note 25a: Review of Probability
- Note 25b: Probability: An Overview
- Note 26: Estimation

## 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 who are officially enrolled in that section will get seating priority. See Syllabus for more information.

- Discussion 00a: Propositional Logic, Proofs (solution)
- Discussion 00b: Proofs (solution)
- Discussion 01a: Induction (solution)
- Discussion 01b: Stable Marriage (solution)
- Discussion 02a: Graph Theory (solution)
- Discussion 02b: Graph Theory (solution)
- Discussion 03a: Modular Arithmetic (solution)
- Discussion 03b: Modular Arithmetic, Bijections (solution)
- Discussion 04a: Fermat's Little Theorem, RSA (solution)
- Discussion 04b: Polynomials (solution)
- Discussion 05a: Lagrange Interpolation, Erasure Codes, Secret Sharing (solution)
- Discussion 05b: Berlekamp-Welch
- Discussion 06a: Polynomials
- Discussion 06b: Error Correction
- Discussion 07a: Countability, Computability
- Discussion 07b: Counting
- Discussion 08a: Basic Probability
- Discussion 08b: Conditional Probability
- Discussion 09b: Probability, Independence
- Discussion 10a: Random Variable, Expectation
- Discussion 10b: Variance, Inequalities
- Discussion 11a: LLN, LLSE
- Discussion 11b: Conditional Expectation
- Discussion 12a: Markov Chain I
- Discussion 12b: Markov Chains II
- Discussion 13a: Continuous Probability I
- Discussion 14a: Continuous Probability II
- Discussion 14b: Continuous Probability III

## Homeworks

All homeworks are graded for accuracy and it is highly-recommended that you do them. Your lowest homework score will be dropped, but this drop should be reserved for emergencies. See Syllabus for more information.

- Homework 00: Propositional Logic/Proofs (Tex) (solution)
- Homework 01: Proofs/Induction (Tex) (solution)
- Homework 02: Induction/Stable Marriage/Graph Theory (Tex) (solution)
- Homework 03: Graph Theory (Tex) (solution)
- Homework 04: Modular Arithmetic (Tex) (solution)
- Homework 05: Chinese Remainder Theorem, RSA, Polynomials (Tex)
- Homework 06: Polynomial
- Homework 07: Countability
- Homework 08: Counting
- Homework 09: Basic Probability
- Homework 10: Random Variable
- Homework 11: Inequalities etc.
- Homework 12: Conditional Expectation
- Homework 13: Markov Chain, Continuous Probability
- Homework 14: Continuous Probability

## Lecture Slides

Slides generally follow the notes. Lecture videos are provided via CalCentral. See Syllabus for more information.

- Lecture 1 (full) (6up): Propositional Logic.
- Lecture 2 (full) (6up): Proofs.
- Lecture 3 (full) (6up): Induction.
- Lecture 4 (full) (6up): Stable Marriage Algorithm.
- Lecture 5 (full) (6up): Graphs, Eulerian Tours, and Planar Graphs.
- Lecture 6 (full) (6up): Graphs, Coloring, Types of Graphs.
- Lecture 7 (full) (6up): Modular Arithmetic.
- Lecture 8 (full) (6up): Modular Arithmetic/Review.
- Lecture 9 (full) (6up): RSA.
- Lecture 10 (full) (6up): Polynomials, Secret Sharing, Coding.
- Lecture 11 (full) (6up): Berlekamp-Welch. (Draft)
- Lecture 12 (full) (6up): Countability/Uncountability. (Draft)
- Slide 12: Countability
- Slide 13: Foo Bar Baz