15-451/651: Algorithm Design and Analysis (Fall 2025)

Course Description

15-451/651 is an advanced undergraduate/masters algorithms class. We cover fundamental algorithmic modeling techniques (e.g. dynamic programming, graphs, network flows, linear programming), advanced algorithmic paradigms (e.g., approximation algorithms, online algorithms, streaming algorithms), and methods for analyzing algorithms and problems (e.g., lower bounds, amortized analysis, probabilistic analyses of randomized algorithms).

Prerequisites: A minimum grade of C in 15-210, 21-241, 15-251 (or 21-228).

Class Hours

Lectures

Tuesday and Thursday at 12:30PM to 01:50PM, DH 2315

Lecture attendance is strongly encouraged but not required.

Recitations (Friday)

SecTypeLocationTimeStaff
AReview-HeavyBH A5310:00-10:50 amLillian and Brenda
BProblem-HeavyPH 226B10:00-10:50 amJolyne and Thomas
CReview-HeavyPH 226B11:00-11:50 amEllie and Tanisha
DProblem-HeavyPH 225B11:00-11:50 amMichael and Thomas
EReview-HeavyWEH 470912:00-12:50 pmSanjana and Ellie
FProblem-HeavyCFA 10212:00-12:50 pmJerrick and Thomas
GReview-HeavyCFA 1021:00-1:50 pmTanisha and Ellie
HProblem-HeavyPH 225B1:00-1:50 pmEthan and Jerick

This semester we are offering two different styles of recitation. You are welcome to switch between the two at any point. Please contact your section TAs if you want to switch. We are always happy to accomodate.

Review-heavy sessions (A, C, E, G). Review-heavy (More review) recitations will spend additional time reviewing definitions and key ideas from the lectures before diving into the problems. Note that review-heavy sessions are not guaranteed to be able to cover all of the recitation problems due to the extra time spent on review. It is therefore your responsibility, if you attend a review-heavy session, to look over the remaining problems and ensure you understand the solutions in your own time after your recitation.

Problem-heavy sessions (B, D, F, H) Problem-heavy (More problems) recitations will dive straight into the problems and run at a faster pace. If you attend a problem-heavy recitation, review will be minimal, so you are expected to have already reviewed the lecture notes and have a reasonable understanding of the week's lecture content before you arrive.

Tutoring

One-on-one tutoring is available. Sign up for tutoring.

Office Hours

The office hour schedule can be found on the course calendar below. Although most time slots are regular every week, they may occasionally change and be rescheduled, so always double check the calendar before deciding to go!

Course Calendar

You may need to be logged into your Andrew (CMU) Google account to be able to view the calendar.