Learner Reviews & Feedback for Graph Search, Shortest Paths, and Data Structures by Stanford University
About the Course
Top reviews
Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.
It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.
151 - 175 of 206 Reviews for Graph Search, Shortest Paths, and Data Structures
By luketerry
•It's so helpful!
By Haixu L
•Learned a lot!
By 秦天
•amazing course
By Karim E
•Awesome course
By Ajit C B
•Great course!
By Rishabh K
•just awesome!
By Ryan S
•Great course
By Saurav M
•NIce course
By Maxim M
•brilliant!
By monkfish
•great fun!
By Madhurya R
•Great job
By clayton w
•excellent
By Felice F
•Loved it
By Neo
•Awesome!
By goldkeytom
•excelent
By ryan
•Awesome!
By Yisheng Y
•Awesome!
By Ahmad e D
•🔥🔥🔥
By Jingyuan W
•Great！
By dynasty919
•nice!
By Sergey T
•This course was useful to me, thanks. As usual, I liked lectures and programming assignments provided, except for week 4.
I didn't like week 4 materials. It was a huge disappointment to me when the theory about hashing appeared to be too 'theoretical' with absolutely no code at all. It's just some high concept maths and nothing more. It is a real disaster if you are a 'doer' because you'll probably get almost nothing from 4th-week lectures and will be ought to learn about hashing somewhere else. This comes to a question of whether you need to learn hash tables here (and pay your money) or not. So if you have never encountered hash tables in your life, you might want to learn it before you take this course. In that case, consider it as a requirement for your enrollment.
By Christopher E
•The only reason this is not a 5-star review is because of the Week 4 programming assignment. The point of Week 4 is to demonstrate the usefulness of using a hash table when frequent look-ups are necessary. However, the constants inherent to the assignment problem make the suggested algorithm take anywhere from 30 min to hours. Meanwhile, there is another algorithm that can accomplish the task in mere seconds, but this is not apparent without scouring the message boards for help. I feel it would be better to either rethink the assignment to bring it more in line with the point of the teaching material, or deliver some instruction on the actually useful algorithm, which is fascinating in its own right.
Otherwise, this course is excellent as usual.
By Gonzalo G A E
•In general, the specialization is great (it's challenging, full of interesting material, and the Prof. is interesting yet light to watch for hours in video). However, two of the programming exercises in this course seemed required solutions that were not related to the covered topics and for which the week's material provided sub-optimal (hence ultra slow) solutions. That was a bit frustrating. Nonetheless, it forced me to explore more about the algorithms, data structures and other solutions.
Still a great and challenging course!
By Sivaramakrishnan
•Algorithms part of the course was phenomenal as always. But the Data Structure side of the course was (a bit of shuffling around the point?) little less engaging. I realize that DS is as important as Algorithms but is certainly not as fun to teach as Algorithms. Maybe the assignments and Quizzes could be restructured to make DS lessons more engaging. Just my 2 cents, otherwise Prof. Tim was cool as always!
By Ahmad B E
•Great course for computer scientists. It is easy to understand but it takes too much time to be completed. The video lectures were long and full of too much explanation. And the week 4 programming assignment took very long running time to complete using the algorithm specified in the course but less time using other algorithms.
Coursera Footer
