15-259/559 Probability and Computing (PnC) 12 Units, SPRING 2026
Where probability meets chocolate!
Probability theory has become indispensable in computer science:
It is at the core of artificial intelligence and machine learning,
which require decision making under uncertainty.
It is integral to CS theory, where probabilistic analysis and randomization form the basis of many algorithms.
It is a central part of
performance modeling in computer networks and systems, where
probability is used to predict delays, schedule resources, and
provision capacity.
This course gives an introduction to probability as it is used in computer science theory and practice,
drawing on applications and current research developments as motivation and context.
TEXTBOOK FOR CLASS
The course textbook is Introduction to Probability for Computing, 2024. The book is freely available here: www.probabilitybook.org . We will cover Chapters 1-18 of this book and parts of Chapter 19.
Discrete & Continuous Probability
Probability on events.
Discrete and continuous random variables.
Conditioning and Bayes.
Variance and higher moments.
Laplace transforms and z-transforms.
Gaussians and Central Limit Theorem.
Tails and stochastic dominance.
Systems Modeling
Heavy-tailed distributions.
Poisson processes.
Simulation of random variables.
Event-driven simulation.
Statistics
Estimators for mean and variance.
Maximum likelihood estimation (MLE).
MAP estimation.
Bayesian statistical inference.
Confidence intervals.
If you like this class, consider taking the follow-on class with the same textbook: 15-359 PnC II.
That class covers Chapters 18-27:
Chernoff bounds, Hoeffding Bounds, Balls-and-Bins Problems,
Hashing, Randomized Algorithms, Discrete-Time Markov Chains, Ergodicity Theory.
CLASS/RECITATION TIMES:
Lectures: TUESDAY and THURSDAY 12:30 pm - 1:50 pm, TEP 1403
Recitations:
A: FRIDAY 9:00 am - 9:50 am, PH A19A, TA: TBD
B: FRIDAY 1:00 pm - 1:50 pm, WEH 8427, TA: George Liu