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 211 Reviews for Graph Search, Shortest Paths, and Data Structures
By Bastin J
•Fantastic Course
By Deleted A
•Excellent course
By Khan M A
•Very Nice Course
By luketerry
•It's so helpful!
By AKLI J E Y
•Amazing course
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.
Coursera Footer
