Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming(으)로 돌아가기

4.8

별점

1,056개의 평가

•

122개의 리뷰

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)....

RG

Apr 27, 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.

AB

Apr 23, 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!

필터링 기준:

교육 기관: Rúben G

•Apr 27, 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.

교육 기관: Sachin G W

•Feb 25, 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.

교육 기관: Nicolas T

•Jun 14, 2019

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.

교육 기관: Rishabh T

•May 27, 2019

worst teaching skill

교육 기관: Huong M L

•Apr 29, 2020

I'm finally able to come up with my own dynamic programming solutions after taking this course, something I've never been able to do before, and it's all thanks to professor TIm Roughgarden's amazing and unique approach! Other lectures and articles on the web only list a bunch of DP problems and their corresponding solutions, without actually explaining how you could have arrived at those solutions yourself, but Tim took a different approach and showed you, step by step, how to both come up with a solution and prove its correctness at the same time. Thank you so much, Tim! You rock!

교육 기관: Daniel P

•Jan 19, 2017

The best Coursera class I took so far! The instructor has a good pedagogic approach -- for every problem he discusses, he starts with an intuitive explanation illustrated on a simple example, and afterwards provides a rather rigorous justification for the algorithms (omitting only secondary details).

I found the problems challenging, and the quizzes required quite some thought, not only repeating/slightly modifying statements made already in the lectures. This made it feel closer to a real class than the other Coursera courses I took so far.

교육 기관: Alexander L

•Nov 11, 2019

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.

교육 기관: Kaan A

•Nov 07, 2019

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.

교육 기관: Dhruvesh P

•Nov 18, 2017

The course is very detailed and does complete justice to the title. I would call this an intermediate level course and would recommend that this be done after the first two courses in the specialization.

Coming to the quality of lectures. The material was presented in a very logically consistent manner. By far the best lectures on dynamic programming that I've seen.

교육 기관: Alexey P

•Mar 08, 2017

Tim does an excellent job explaining things at depth and at the same time keeping things interesting. The quizes and programming assignments are well thought and carefully balanced vs the material taught. They force you to stretch just a bit beyond the lectures, which is a good thing IMHO.

And there is a wealth of advanced/optional material for the curious.

교육 기관: Dilyan M

•Dec 10, 2018

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.

교육 기관: Damian C

•Mar 22, 2018

Excellent Course. I really enjoyed it. Stretched my imagination and analytical capacity to new frontiers. The problems studied during the course stimulate you to learn more about new algorithms and coding, There's so much more to learn now. Many thanks to Professor Roughgarden and his team for making this available. Keep the great work!

교육 기관: Jonathan M

•May 18, 2020

This was more challenging the first two courses in the sequences but after completing it, I feel like my intuition about algorithms has improved. Understanding the greedy and dynamic paradigms opens up a wider range of problems to be solved. The course content does a great job of introducing both of these at a high-level.

교육 기관: GongPing

•Aug 20, 2017

Excellent lectures on Dynamic Programming! The examples chosen in lectures are really typical! I tried to practice on more DP problems on Geeksforgeeks. Surprisingly many DP problems are just extension of the examples gone through in these videos. Reading the CLRS book after watching the lectures become much much easier!

교육 기관: Sergey T

•Jun 28, 2020

This course is great, thanks!

The idea of splitting those 20-30 minutes videos from parts 1 and 2 into smaller ones is great! Also, I loved the idea of 2-3 programming tasks in 1. That's very helpful.

Any way to bring sequence alignment and optimal binary search trees programming assignments in?

교육 기관: Ashish D S

•Aug 13, 2018

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!

교육 기관: Ahmad B E

•Jun 16, 2017

Great course for who is willing to learn new algorithms and having hard time to learn them alone by reading text box. The explanation is easy and clear. And the material is essential for who want to get started in greedy algorithms and dynamic programming.

교육 기관: Oleksandr S

•Feb 17, 2020

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.

교육 기관: Anastasia Z

•Jan 30, 2018

I really liked this course as well as the first two courses from the algorithms specialization. I agree with other reviewers that this course is more challenging, which is a good thing - I learned a lot and enjoyed solving harder problems.

교육 기관: Khant

•Nov 11, 2017

This course is really challenging compared to previous courses. Problems introduced in Dynamic Programming are harder than I expected and course books they recommended will be needed to understand better about the lecturers of this course.

교육 기관: Rodolphe L

•Mar 15, 2018

I thought this course was kind of harder than the 2 previous one in the specialization (mainly the problems sets which require way more thinking)

It's a very good quality course to strenghten the basics, but in depth.

교육 기관: Fernando L C

•Jun 30, 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!

교육 기관: Aria B

•Apr 23, 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!

교육 기관: Jephte E

•Dec 28, 2019

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.

교육 기관: madcdevelop

•Mar 15, 2020

Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.