Peking University · 00110060

Algorithm Design and Analysis

算法设计与分析

A PKU course on complexity analysis, divide and conquer, greedy methods, dynamic programming, graph traversal, backtracking, NP-hardness, approximation, and randomized algorithms.

Subject：Algorithms

Level：Undergraduate

Suggested stage：Years 2–3 (inferred)

Public-material edition：Official course page (year not stated)

Language：Chinese

Videos：Not verified

Assignments / solutions：Not verified / Not verified

Prerequisites

CalculusData structures →Discrete mathematics →Probability →

Start here

All official course content

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

13 direct tasks

▶Lectures, video & readingCourse content in the official sequence13

Official unit 1: Algorithm Evaluation and Asymptotic Complexity Official unit 2: Divide and Conquer Official unit 3: Recurrences and the Master Theorem Official unit 4: Selection and Sorting Official unit 5: Fast Fourier Transform Official unit 6: Greedy Algorithms Official unit 7: Dynamic Programming Official unit 8: Graph Search and Traversal Official unit 9: Backtracking Official unit 10: Branch and Bound Official unit 11: NP-Hard Problems Official unit 12: Approximation Algorithms Official unit 13: Randomized Algorithms

Official resource hubs

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

Official detailed syllabus and hour allocationPeking University School of Mathematical Sciences ↗

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.

Peking University School of Mathematical Sciences · verified 2026-08-22

Open official course ↗Report a resource issue