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). The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180–acre (3,310 ha) campus near Palo Alto, California, United States.
Courses : 5
Specification: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
53 reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming