YoVDO

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Offered By: Stanford University via Coursera

Tags

Algorithms and Data Structures Courses Knapsack Problem Courses Minimum Spanning Tree (MST) Courses Greedy Algorithms Courses Dynamic programming Courses Clustering Courses Sequence Alignment Courses

Course Description

Overview

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

Syllabus

  • 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).
  • Week 3
    • Huffman codes; introduction to dynamic programming.
  • Week 4
    • Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Taught by

Tim Roughgarden

Tags

Related Courses

Algorithms: Design and Analysis, Part 2
Stanford University via Coursera Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Biology Meets Programming: Bioinformatics for Beginners
University of California, San Diego via Coursera 算法基础
Peking University via Coursera 算法基础 | Fundamental Algorithms
Peking University via edX