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
59,217 already enrolled
Offered By
Algorithms SpecializationStanford UniversityAbout this Course
31,368 recent views
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 3 of 4 in the
Intermediate Level
Approx. 15 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Skills you will gain
Spanning TreeAlgorithmsDynamic ProgrammingGreedy Algorithm
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 3 of 4 in the
Intermediate Level
Approx. 15 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Offered by
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.
Syllabus - What you will learn from this course
4 hours to complete
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
4 hours to complete
16 videos (Total 160 min), 4 readings, 2 quizzes
4 hours to complete
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
4 hours to complete
16 videos (Total 188 min), 2 readings, 2 quizzes
3 hours to complete
Week 3
Huffman codes; introduction to dynamic programming.
3 hours to complete
11 videos (Total 105 min), 1 reading, 2 quizzes
4 hours to complete
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
4 hours to complete
10 videos (Total 107 min), 3 readings, 3 quizzes
Reviews
TOP REVIEWS FROM GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
by FCJun 29, 2018
Tim Roughgarden is a fantastic teacher! He really cares about explaining in a simple manner and also give you useful hints and advices to dive deeper in all the topics of the course. Thanks, Tim!
by RGApr 26, 2020
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.
by ABApr 22, 2020
Like the other courses in this specialization, the material is interesting and coherent. The pace is not fast enough to get lost and not so slow to insult your intelligence. I enjoyed it a lot!
by SWFeb 24, 2019
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.
About the Algorithms Specialization
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.
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.
