15-451 Algorithm Design and Analysis

12 units, Carnegie Mellon University

This course is about the design and analysis of algorithms. We study specific algorithms for a variety of problems, as well as general design and analysis techniques. Specific topics include searching, sorting, algorithms for graph problems, efficient data structures, lower bounds and NP-completeness. A variety of other topics may be covered at the discretion of the instructor. These include parallel algorithms, randomized algorithms, geometric algorithms, low level techniques for efficient programming, cryptography, and cryptographic protocols.

Prerequisites: 15-210 (min C) and 21-241 (min C) and (15-251 (min C) or 21-228 (min C))

Offered: Spring 2027, Fall 2026, Spring 2026, Fall 2025

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