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

This is a great course. The teacher is very clear, and the material is very interesting. The programming assignments are interesting: the problems asked are very simple, but the input is generally too large to use brute force: you really have to implement the algorithms presented in the videos. This makes you realize how much smart algorithms can make a difference.

The level of the class is relatively high, compared to other Coursera courses I've taken. If you want some serious training on algorithms, look no further.

great fun!

Very helpful and intuitive. Made me a better programmer overall. I highly recommend it, even if you're not that interested in algorithms.

nice!

I am still really enjoying the course. The programming assignment for week four didn't require a hash table to implement, so didn't seem entirely relevant to the week's material (instead I used sets). At any rate, would wholeheartedly recommend the course.

Useful refresher!

It's so helpful!

great course which provided me with a strong foundation in data structure and algorithm.

Awesome course

excelent

just awesome!

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

Amazing course! Tim Roughgarden is an exceptional teacher! I'm really enjoying reviewing this algorithms and data structures topics

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.

Data Structures helps me resolve problem quickly, and force me to think the problems in a more solid way. I will try to figure out what kind of operations I need when solve a specific problem and which data structure is suitable in that situation.

This was another good one, providing a slightly deeper dive than I had seen in other courses. The big revelation here, for me, was the addition of Bellman-Ford algorithm for evaluating shortest path in networks (graphs) that have some negative distance values between nodes.

I also like the approach to data structures (high-level, then drilling down into increasing detail for level of interest) I find it hard to say I understand a data structure based on "Interface and Theory" and I would have felt the certification meant more with at least a rudimentary implementation. I guess that makes me a coder at at heart.

I am about to jump into the next course of the specialization: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming As with the two courses before, I am expecting new revelations about the kind of programming issues I've been solving for more than fifteen years.

This course is very good! The professor explain the algorithms in detail , and the programming assignment is challenging！Highly recommend!

I found this second part of the Algorithms stream fascinating. Getting into the details of Algorithms I only knew by name before was an extremely rewarding experience. Lots of fun and very enjoyable. Thanks Coursera for making the available, keep the good work!

Good introductory coverage and challenging assignments.

Great course, at least for people like me who lack of computer science background.

Lots of basic data structures covered. Very good introduction!

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

One of the greatest courses on this website. However, I believe this course will be more approachable if it contains more practical guide such as sample solution for algorithms.

Awesome!