To support our site, Class Central may be compensated by some course providers.

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Stanford University via Coursera

students interested
  • Provider Coursera
  • Subject Algorithms and Data Structures
  • $ Cost Free Online Course (Audit)
  • Session Upcoming
  • Language English
  • Certificate Paid Certificate Available
  • Start Date
  • Duration 4 weeks long

Taken this course? Share your experience with other students. Write review

Sign up to Coursera courses for free Learn how

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

Taught by

Tim Roughgarden

Related Courses

Reviews for Coursera's Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Based on 0 reviews

  • 5 star 0%
  • 4 star 0%
  • 3 star 0%
  • 2 star 0%
  • 1 star 0%

Did you take this course? Share your experience with other students.

Write a review

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.