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).
Dieser Kurs ist Teil der Spezialisierung Spezialisierung Algorithmen
Keine Kreditkarte erforderlich – Sie können direkt einsteigen!
von
Über diesen Kurs
Kompetenzen, die Sie erwerben
- Spanning Tree
- Algorithms
- Dynamic Programming
- Greedy Algorithm
von

Stanford University
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.
Lehrplan - Was Sie in diesem Kurs lernen werden
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
Week 3
Huffman codes; introduction to dynamic programming.
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
Bewertungen
- 5 stars86,47Â %
- 4 stars11,51Â %
- 3 stars1,66Â %
- 2 stars0,08Â %
- 1 star0,25Â %
Top-Bewertungen von GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.
I learned more about Greedy Algorithms and Algorithms to compute MST's and their importance on real world problems. Also I got to start to understand Dynamic Programming in a way I didn't before.
As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.
A more explanatory answer sheet would be helpful. Might need to be secured via limited time login session to avoid leaking on the web.
Über den Spezialisierung Algorithmen
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.

Häufig gestellte Fragen
Wann erhalte ich Zugang zu den Vorträgen und Aufgaben?
Was bekomme ich, wenn ich diese Spezialisierung abonniere?
Ist finanzielle Unterstützung möglich?
Haben Sie weitere Fragen? Besuchen Sie das Learner Help Center.