Learner Reviews & Feedback for Graph Search, Shortest Paths, and Data Structures by Stanford University

Great course; especially on Data Structures and when certain ones are appropriate. I do wish the final exam solutions would be posted after completing the exam successfully in the same way the problem set solutions, hints and comments are provided.

the later graph algorithms are implemented rather cursory. It is quite hard for us to implement it at home using a "big idea" as given in the video. I wish the instructor could give us some intuitions of how Java, C++, or Python handle the case.

Great course but needs restructuring. The videos of how an algorithm works come after extensive discussion on what its action's running times are. If this were flipped and we learned how it works before running times it would be more intuitive.

Great course! The programming assignment for Week 4 was a bit demoralizing, though. I am very certain I had the right answer, but had to implement another solution that did not involve Hash Tables in order for it to process in < 24 hours.

Great course, the first exercise was a little bit hard but the material is useful, if you read the relevant book then the course is even easier.

Last I want to mention that writing the code in Python makes the course easier.

The material was a little light and far fewer video quiz questions to test our understanding of the material. I also tried to test myself on BFS and DFS by doing online quizzes like geeksforgeeks - bombed really hard.

assignments didn't seem as interesting or complex as class 1, besides week 1 of class 2. Lecture material was high quality however, and the advanced optional material is appreciated

Hope the professor could teach more about hashing and give a detailed implementation of some data structures or supply some interface template code.

This course was much harder than the first one. Plan to spend extra time doing the assignments. However, it is totally worth it!

Great course! Best one for refreshing concepts! Can act as a starting point too! Absolutely love the explanation.

Great coverage of graphs and basic implementations. Wish hash implementation was discussed in more details.

more examples of hashing algorithms could have been introduced (like consistent hashing, Murmur hash etc.)

An exhaustive and engaging course. Recommended if you can work hard with dedication. Overall very nice

The optional components seem to be important to answer the quizzes and questions for some weeks.

it helped me a lot specially the hash table content portion..Thanks a lot

i understand algorithms very well thank u for learning me more detail

Very nice introduction to Graph Search. Thanks to the instructors!

Mentor help is almost non-existent.

NICE CONTENT.

Good learning

good

I feel it is an ok course, however the assignments can be made better. The assignments in Alogorithms offered by princeton are more interesting and meaningful.

Some of the problem sets were a little fiddly. Especially the last one, which was crushingly terrible if you tried to actual use the solution he told you to.

Sometimes badly synchronized, there are also mistakes in the videos which haven't been corrected.

Wonderful material but some issues with programming assignments which need updating