Join NowName: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Creator: Stanford University
Category: Software > Computer Software > Educational Software
Topic: Math and Logic
Tag: algorithms, clustering, dynamic, programming, Scheduling
Availability: In stock
Price: USD 79.00
Creator: Stanford University
Category: Software > Computer Software > Educational Software
Topic: Math and Logic
Tag: algorithms, clustering, dynamic, programming, Scheduling
Availability: In stock
Price: USD 79.00
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).
