Follow

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



Career Relevance by Data Role

The techniques and tools covered in Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming are most similar to the requirements found in Data Scientist job advertisements.


Similarity Scores (Out of 100)

Fast Facts
Techniques
Algorithms Decision Trees Programming Cluster Analysis

Similar Opportunities
Data Structures Fundamentals

EdX - University of California, San Diego

Advanced Data Structures

EdX - New York University

Data Structures and Algorithms (II)

Coursera - Tsinghua University

Algorithmic Toolbox

Coursera - National Research University Higher School of Economics

Programming Fundamentals

Coursera - Duke University

Data Structures and Algorithms (III)

Coursera - Tsinghua University

Data Structures

Coursera - National Research University Higher School of Economics

Approximation Algorithms Part I

Coursera - École normale supérieure

Graph Algorithms in Genome Sequencing

EdX - University of California, San Diego