Tim Roughgarden
9.1/10
(Our Score)
Product is rated as #11 in category Data Structures and Algorithms
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.
Instructor Details
Votes: 0
Courses : 5
Specification: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
|
53 reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Show all
Most Helpful
Highest Rating
Lowest Rating
Add a review
| Price | Free |
|---|---|
| Provider | |
| Duration | 22 hours |
| Year | 2017 |
| Level | Intermediate |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
FREE
Lin M K –
Very difficult! That’s what heroes do.
Luiz C –
Tim Roughgarden manages to turn a dry topic like “Algos” into a sexy hot one!!
Feiyu L –
Makes Greedy algorithm and Dynamic Programming so clear to understand.
Jonathan H –
One of the best specializations on this site. Highly recommended!
Chris S –
While i thought the algorithms are very good – It could use just a small amount of expansion on the specifics and background.
Fernando L C –
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!
Brande G –
A great course, likewise the other courses in the series. It is probably the best series of algorithmic thinking courses.
Abhishek C –
excellent course
Tianyi Z –
Not bad programming tests. At least it made me try
Rafael E –
Another great course from Coursera!
Yiming Z –
Harder than the first two courses and I really enjoy it!
Anirudh J –
NICE
Ashish D S –
Excellent course, I found this course hard as compared to earlier two courses. Many of the Lectures needs to be viewed twice to understand to my minimum level of satisfaction. Quizzes make sure that you understand concepts well and programming assignments are excellent!
Nikola G –
Difficult but enriching course! Really helpful to me 😀
Joern K –
Sometimes badly synchronized, there are also mistakes in the videos which haven’t been corrected.
Jesse D –
The most difficult course in the specialization so far. I learned a lot.
Pawel K S –
Great material, explained very well, but the lack of feedback on tough problem sets can be frustrating;
Abdel H D –
Really great and challenging course!!!!
Putcha L N R –
Amazing course! Great content indeed!
Frank Z –
Very great class!
Yifeng L –
Course is great. However, for me, there’s some lecture I cannot understand so I have to find another course with more explanation.
Dilyan M –
The course was excellent. I did not have enough time for all the optional videos, but I still feel like I learned a ton and I can always come back to them later, which is great. This specialization feels like it’s getting a little easier for me with every course, which means that it’s very well constructed and doing what it’s supposed to do.
Ricardo D –
Great Pace – good examples – always going to the point – clear and providing good info in regards to the subject in study.
Garrett S –
Great material and love the professor, Tim. Some quiz questions are tricky, but liked it overall.
Charles H –
Some assigments are really difficult. Often I was glad to read some tips in the forum. But the course is definitely challenging and makes you learn many things.
Sachin G W –
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.
Saurav M –
Nice course
Bianca D –
The forums are not very active, and there are a lot of unanswered questions from months and years ago. It seems like there have not been active staff/mentors in the forums for a while. Also the final exam had two duplicate problems from the problem sets.
Yuanzhan W –
This course is harder than the previous two in the specialization but equally fun.
Anant K S –
A little too difficult.
Rishabh T –
worst teaching skill
Sui X –
very good course
Andre C –
Good old fav algorithms taught with current problems.
praveen k –
mass
Nicolas T –
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.
Neeraj T –
I really liked the dynamic programming part
Sergio S –
Great course! It is hard!
Genyu Z –
It’s nice. Teacher can give me inspirations from different point of views, which teaches me a lot. Thanks!
Nguyen K T –
good
amosnier –
Great learning. Quite tough too!
Rui Z –
excellent! thx
Minsub L –
very good course of algorithms
Vo T T –
Thank you, teacher! This course is very helpful to me.
Madhurya R –
Great job
Atul V –
Honestly Speaking, I didn’t like the course much. The explanation was quite complicated. I had to learn most of the things from youtube.
Frederik D K –
Great course!
Kaan A –
I’m absolutely happy with the time that I spent on this course. Now I finished my third course on the Algorithms Specialization from Tim Roughgarden. I love the instructor the way he speaks is amazing. Zero uhmms absolutely zero schmschm. Amazing! I’m looking forward to start the fourth course of the specialization which is the final one. It’s been 2 and a half months since I started the Algorithms Specialization. Thanks for such a great content.
Alexander L –
Very interesting. I learned a lot of new things. 5 stars! Just a few things that could be improved: –– The video and its audio are not really synchronized (maybe because the video is pretty old) –– The subtitles are not good. Even the english ones were not written by someone who knows what the professor is talking about… Nowadays there are better solutions to validate whether someone solved a programming task. geeksforgeeks.org and hackerrank.com for example just execute the program with test input. But all in all: Very positive experience.
Jephte E –
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
Georgios K –
A beautiful course, I had already done the other two parts of this series of courses. This course focuses on the Greedy Algorithms and Dynamic Programming. I had not used these two types of algorithms before. The difficulty of the exercises is not great but there is one programming assignment which is really hard to debug. Nevertheless there are good points in the forum. Professor and forum members thank you for this beautiful learning experience.
Oleksandr S –
It’s a hard and challenging course. I’m really excited about the knowledge I gain. The greedy algorithms are really not so easy and you always can make an error. The Union Find with ranking and Dynamic Programming are the pearl of the Course.
Oleg B –
Great course. A lot to learn. Syllabus is compressed, but clear.
Sucre C –
Greedy Algos are fuzzy, but funny to do the mind experiments!