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).
This course is part of the Algorithms Specialization
About this Course
Skills you will gain
- Spanning Tree
- Dynamic Programming
- Greedy Algorithm
Syllabus - What you will learn from this course
- 5 stars86.44%
- 4 stars11.50%
- 3 stars1.64%
- 2 stars0.16%
- 1 star0.24%
TOP REVIEWS FROM GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
Great learning experience!!!
I love dynamic p the most.
Assignment 4 is so challenging that it takes me a week to finish the program and debug it!!!
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
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.
About the Algorithms Specialization
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.