Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Add to Favourites
1
1
1
1
1
Price:
7867
EUR
7867
EUR
Contact
Stanford University
More details about the program
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).
Specific details
Category of Education
Computer Sciense and IT
University
Stanford University
External Links
More details about the program