Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)
Course Auditing
Categories
Effort
Certification
Languages
Misc

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)
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).

Class Deals by MOOC List - Click here and see Coursera's Active Discounts, Deals, and Promo Codes.

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Course 3 of 4 in the Algorithms Specialization.


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.



5
Average: 5 ( 3 votes )

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.