Main Profile

At A Glance

Algorithms: Design and Analysis, Part 2

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.

Start Date: Jun 01, 2014 Topics: Design


Algorithms: Design and Analysis, Part 2's Full Profile



This course covered greedy algorithms, including applications to minimum spanning trees and Huffman codes; dynamic programming, including applications to sequence alignment and shortest-path problems; and exact and approximation algorithms for NP-complete problems.


  • Dates: Jun 01, 2014 to Jul 01, 2014
  • Level of Difficulty: Beginner
  • Size: Massive Open Online Course
  • Instructor: Tim Roughgarden
  • Institution: Coursera
  • Topics: Design

Provider Overview

About Coursera: Coursera is an education company that partners with the top universities and organizations in the world to offer courses online for anyone to take, for free.

Latest Tweet

Coursera Offers Courses In: Art

Questions about Algorithms: Design and Analysis, Part 2

Want more info about Algorithms: Design and Analysis, Part 2? Get free advice from education experts and Noodle community members.

  • Answer