6.042J | Fall 2005 | Undergraduate

Mathematics for Computer Science

Lecture Notes



This resource discusses the quotes by Jacob D. Bernoulli, deviation from the mean, Markov bound, Chebychev bound, binomial bound, Weak Law of large numbers, and the principle behind stimation (polling), algorithm analysis, design against failure, communication through noise, and gambling.

Resource Type:
Lecture Notes
Learning Resource Types
Problem Sets with Solutions
Exams with Solutions
Lecture Notes