# Algorithms: Design and Analysis, Part 2

## Tim Roughgarden, Stanford University

In this course you will learn several fundamental principles of advanced algorithm design: greedy algorithms and applications; dynamic programming and applications; NP-completeness and what it means for the algorithm designer; the design and analysis of heuristics; and more.

In this course you will learn several fundamental principles of advanced algorithm design. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression. You'll learn the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments.  You’ll learn what NP-completeness and the famous “P vs. NP” problem mean for the algorithm designer.  Finally, we’ll study several strategies for dealing with hard (i.e., NP-complete problems), including the design and analysis of heuristics.  Learn how shortest-path algorithms from the 1950s (i.e., pre-ARPANET!) govern the way that your Internet traffic gets routed today; why efficient algorithms are fundamental to modern genomics; and how to make a million bucks in prize money by “just” solving a math problem!

### Syllabus

Weeks 1 and 2: The greedy algorithm design paradigm.  Applications to optimal caching and scheduling.  Minimum spanning trees and applications to clustering.  The union-find data structure.  Optimal data compression.

Weeks 3 and 4: The dynamic programming design paradigm.  Applications to the knapsack problem, sequence alignment, shortest-path routing, and optimal search trees.

Weeks 5 and 6: Intractable problems and what to do about them.  NP-completeness and the P vs. NP question.  Solvable special cases. Heuristics with provable performance guarantees.  Local search. Exponential-time algorithms that beat brute-force search.

### Recommended Background

How to program in at least one programming language (like C, Java, or Python); and familiarity with proofs, including proofs by induction and by contradiction.  At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.  The course assumes familiarity with some of the topics from Algo 1 --- especially asymptotic analysis, basic data structures, and basic graph algorithms.

No specific textbook is required for the course.  Much of the course material is covered by the well-known textbooks on algorithms, and the student is encouraged to consult their favorite for additional information.

### Course Format

The class will consist of lecture videos, generally between 10 and 15 minutes in length. These usually have integrated quiz questions. There will also be standalone homeworks and programming assignments that are not part of video lectures, and a final exam.

### FAQ

• Will I get a statement of accomplishment after completing this class? Yes. Students who successfully complete the class will receive a statement of accomplishment signed by the instructor.
• What is the format of the class? The class consists of lecture videos, which are broken into small chunks, usually between eight and twelve minutes each. Some of these may contain integrated quiz questions. There will also be standalone quizzes that are not part of video lectures. There will be approximately two hours worth of video content per week.
• What should I know to take this class? How to program in at least one programming language (like C, Java, or Python); familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.  While Part 2 is designed for students who have already taken Part 1, some students have successfully completed Part 2 without taking Part 1.

• 2015年3月16日, 6 星期
• 2014年6月30日, 6 星期
• 2013年9月02日, 6 星期
• 2012年12月03日, 8 星期

• 免费:
• 收费:
• 证书:
• MOOC:
• 视频讲座:
• 音频讲座:
• Email-课程:
• 语言: 英语

### 反馈

Algorithms
Algorithms and data structures from the beginning to advanced analysis.
Алгоритмизация вычислений
1 курс МИЭМ ВШЭ, 4 кредита

Analysis of Algorithms
This course teaches a calculus that enables precise quantitative predictions...
Introduction to Algorithms (Spring 2008)
This course provides an introduction to mathematical modeling of computational...
Computing and Data Analysis for Environmental Applications
This subject is a computer-oriented introduction to probability and data analysis...
Economic Applications of Game Theory
Game Theory, also known as Multiperson Decision Theory, is the analysis of situations...
Discrete Optimization
Tired of solving Sudokus by hand? This class teaches you how to solve complex...

CS 282: Principles of Operating Systems II: Systems Programming for Android
Developing high quality distributed systems software is hard; developing high...
Ruby on Rails Tutorial: Learn From Scratch
This post is part of our “Getting Started” series of free text tutorials on...
NYU Course on Deep Learning (Spring 2014)
Lectures from the NYU Course on Deep Learning (Spring 2014) This is a graduate...
C++ Grandmaster Certification
The C++ Grandmaster Certification is an online course in which participants...
Computational Chemistry (CHEM 4021/8021)
Modern theoretical methods used in study of molecular structure, bonding, and...

First Year Teaching (Secondary Grades) - Success from the Start
Success with your students starts on Day 1. Learn from NTC's 25 years developing...
Understanding 9/11: Why Did al Qai’da Attack America?
This course will explore the forces that led to the 9/11 attacks and the policies...
Aboriginal Worldviews and Education
This course will explore indigenous ways of knowing and how this knowledge can...
Analytic Combinatorics
Analytic Combinatorics teaches a calculus that enables precise quantitative...
Accountable Talk®: Conversation that Works
Designed for teachers and learners in every setting - in school and out, in...