I Understand
We use cookies.Click here for details.

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

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

Created by Stanford University


What you’ll learn

In this educational opportunity you will improve the compentencies required by organizations in 2021. The most in demand technique within the learning resource that is frequently included by organizations is Algorithms. You will also hear about Programming Skills, a trait often requested in job advertisements.

Who will benefit?

Contrasting the description from this learning resource with nearly 10,000 data-related job advertisements, we find that those interested in Data Scientist roles have the most to gain.