15-359 Probability & Computing: Randomized Algs and Markov Chains

12 units, Carnegie Mellon University

Probability theory has become indispensable in computer science. In areas such as artificial intelligence and computer science theory, probabilistic methods and ideas based on randomization are central. In other areas such as networks and systems, probability is becoming an increasingly useful framework for handling uncertainty and modeling the patterns of data that occur in complex systems. This course is a follow-up course to 15-259, Probability and Computing. It will cover Chapters 18-27 of the same textbook, "Introduction to Probability for Computing", by Prof. Harchol-Balter. Topics include concentration inequalities, various randomized algorithms including number theoretic routines, Markov chains and their many applications, and queuing theory. The course will assume familiarity with multivariate calculus and linear algebra.

Prerequisites: 21-325 (min B) or 15-259 (min B)

Offered: Fall 2026

Courseweave needs JavaScript to show sections, workloads and planning tools.