Carnegie Mellon University · 15-451

Algorithm Design and Analysis

算法设计与分析

Design and analysis of algorithms, including efficient data structures, graph algorithms, lower bounds, NP-completeness, approximation, and randomized algorithms.

Subject：Algorithms

Level：Advanced Undergraduate

Suggested stage：Years 3–4 (inferred)

Public-material edition：2026

Language：English

Videos：Not verified

Assignments / solutions：Not verified / Not verified

Prerequisites

Not explicitly listed by the official source; no assumption made.

Start here

All official course content

Lectures, video, assignments and exams are separated so you do not have to hunt through the course homepage.

24 direct tasks

▶Lectures, video & readingCourse content in the official sequence12

Topic 1: Asymptotic Analysis Topic 2: Divide and Conquer Topic 3: Graph Search Topic 4: Shortest Paths Topic 5: Greedy Algorithms Topic 6: Dynamic Programming Topic 7: Network Flow Topic 8: Randomized Algorithms Topic 9: Linear Programming Topic 10: NP-Completeness Topic 11: Approximation Algorithms Topic 12: Algorithm Review

✓Assignments & practiceOpen the matching problem or assignment page12

Official resource hubs

Use these to browse a complete resource collection; the section above links directly to individual study items.

Official lecture materialCarnegie Mellon University Computer Science Department ↗

Source and verification

Every link points to an official university or course-team page. The year identifies the linked public-material edition, not necessarily the latest on-campus offering; a school may have newer materials that are not public. Unknown facts remain unverified rather than guessed.

Carnegie Mellon University Computer Science Department · verified 2026-08-02

Open official course ↗Report a resource issue

← All courses