Algorithms: Design and Analysis, Part 2

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience. The course is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this course, you will have a greater mastery of algorithms than almost anyone without a graduate degree in the subject.

Specific topics in Part 2 include: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes), dynamic programming (knapsack, sequence alignment, optimal search trees, shortest paths), NP-completeness and what it means for the algorithm designer, analysis of heuristics, local search.

About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Note: this course is closing on October 10th, 2016, and relaunching as part of a specialization: https://www.coursera.org/specializations/algorithms

Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional); Huffman codes.

Week 3
Dynamic programming: introduction, the knapsack problem, sequence alignment, and optimal binary search trees.

Week 4
The Bellman-Ford algorithm; all-pairs shortest paths.

Week 5
NP-complete problems and exact algorithms for them.

Week 6
Approximation and local search algorithms for NP-complete problems; the wider world of algorithms.

Final Exam
Final exam (1 attempt per 24 hours)