Computer Science 70 - Discrete Mathematics for Computer Science
Vahab Pournaghshband-Assadi
vahab AT berkeley.edu
Discussion Sections: Fridays 10-11am & 11am-12pm
Office Hours: Mondays 1-2pm @ 511 Soda Hall
> Course Information
CS70 - Discrete Mathematics for Computer Science
Lecturer: Luca Trevisan
GSIs: Alex Fabrikant and Vahab Pournaghshband
T-Th 3:30-5pm 2 LeConte
Web-page: www-inst.eecs.berkeley.edu/~cs70
> Announcements
04/20/2007
No Handout was given for Week 13.
04/13/2007
The solution to the last problem in the notes from Week 12 is included in the .pdf file.
01/28/2007
Due to questions about distinction of Fibonacci elements in Theorem 1 of the second week's
> Discussion Notes
Week 1
Logic
Week 2
Induction/Strong Induction
Week 3
Stable Matching/Introduction to Modular Arithmetic
Week 4
More on Modular Arithmetic
Week 5
Polynomials/Finite Fields/Secret Sharing
Week 6
Error Correcting Codes (Erasure and General Errors)
Week 7
Graphs
Week 8
Basic Counting
Week 9
Probability
Week 10
Probability/Expectation
Week 11
Expectation/Variance
Week 12
Distributions
Week 14
Continuous Random Variables/Normal Distribution/Central Limit Theorem
Week 15
Chernoff Bound/Diagonalization
> Homeworks
Homework 1
Solution 1
Homework 2
Solution 2
Homework 3
Solution 3
Homework 4
Solution 4
Homework 5
Solution 5
Homework 6
Solution 6
Homework 7
Solution 7
Homework 8
Solution 8
Homework 9
Solution 9
Homework 10
Solution 10
Homework 11
Solution 11
Homework 12
Solution 12
www.inst.eecs.berkeley.edu/~vahab/cs70 last update: May 2007