Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Description

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

Price: Enroll For Free!

View Class

Language: English

Subtitles: English

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming – Stanford University

TUN Helps Students!

Resource Content

Resources for Students

School Search

TUN TV

TUN AI

Scholarships

Scholarship Search

Start a Scholarship

Community

Student Tools