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
von
Über diesen Kurs
Kompetenzen, die Sie erwerben
- Spanning Tree
- Algorithms
- Dynamic Programming
- Greedy Algorithm
Lehrplan - Was Sie in diesem Kurs lernen werden
Week 1
Week 2
Week 3
Week 4
Bewertungen
- 5 stars86,43 %
- 4 stars11,51 %
- 3 stars1,64 %
- 2 stars0,16 %
- 1 star0,24 %
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.
One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
Über den Spezialisierung Algorithmen

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.