Kursteilnehmer-Bewertung und -Feedback für Graph Search, Shortest Paths, and Data Structures von Stanford University

A brilliant. The first assignment was particularly challenging, and really really interesting. The rest of the course was pretty good too.

I learned a lot lot lot, no more to say. Fantastic.

Continues to be an engaging and clear teacher.

very nice structured and explained :)

This course let me feel algorithms is not hard as I thought. It is worth to learn

Useful refresher!

Very well-explained lectures!

I enjoyed this course, it was more challenging than the first one in the sequence, especially in the graph-search portion. The last 2 weeks are much more simple, but it is still essential for any serious student of CS to learn about data structures, especially common and practical DS such as heaps and hash tables.

Excellently presented and crafted course. Coursework was challenging but solvable.

One of the most important courses in the specialization.

Excellent video lectures. Great forums that discuss the problems and programming assignments. Challenging material, with satisfying rewards on finding solutions.

nice!

I really enjoyed it. Perfect balance of practice and theory together with clear explanations. I also appreciate the mentors efforts that always answer any questions and try to help. Thank you Tim, Vassilis, and Arjit.

Great course

Awesome course

Really taught me a lot. Rather well-explained, except proof of Dijkstra's - Wikipedia explains it better and faster. But good walkthroughs of how algorithms work, because it helps you to visualise and understand properly. Interesting assignments, although it would be useful to have test cases provided because, especially for week 1 and 4, it takes a ridiculously long time to run the program, and it would be wasted time if you turn out to get the wrong answer. Test cases would help you be more sure that your code is right before you attempt to run it on the humongous file. I had to use PyPy to speed the programs up because I use Python which is generally slow. Advice: for week 1 and 4, use C or C++ or some other fast language. Or Cython if you can get it to work.

Nice explanation and quality exercises!!

The professor is amazing. He has the ability to present the material very clearly, concise, and with a good dose of humour! I would definitely recommend it to anyone interested in algorithms and data structures as an undergraduate or a professional.

Outstanding course! High quality of presentations and topics! Tim Roughgarden is fantastic dude!

This is an excellent course on algorithms, that has given me a deeper understanding of the subject.

I am a theoretical physicist using this course as preparation for coding interviews, and the speed, amount of rigor and optional material (the optional theory problems in particular) feel perfect for my learning effort.

It covers the most common problems in computer programming and gives good program problems for the rigorous learning of the best algorithms

Focused on principles and motivations behind algorithms. You might forget an algorithm you learned, but you will definitely be able to come up with one quickly after this course.

very nice!! excellent professor! excellent courses!!!

A Great course! Just feel excited to continue learning!

This is an excellent course! It is well explained and I would recommend it to anyone interested in algorithms and data structures covered in this course.