Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

This course is part of Algorithms Specialization

Instructor: Tim Roughgarden

Skills you'll gain

  •   Bioinformatics
  •   Computational Thinking
  •   Theoretical Computer Science
  •   Data Structures
  •   Graph Theory
  •   Algorithms

    • There are 4 modules in this course

    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).

    Week 2

    Week 3

    Week 4

    Explore more from Algorithms

    Graph Search, Shortest Paths, and Data Structures

    Dynamic Programming, Greedy Algorithms

    Divide and Conquer, Sorting and Searching, and Randomized Algorithms

    Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

    ©2025  ementorhub.com. All rights reserved