Chevron Left
Zurück zu Graph Search, Shortest Paths, and Data Structures

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

4.8
1,306 Bewertungen
138 Bewertungen

Über den Kurs

The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis)....

Top-Bewertungen

JA

Oct 16, 2018

Interesting problems and explanations. But mathematical analysis is going off of my mind. It has very good explanation. Not sure, whether I can carry forward that knowledge or not.

HC

Nov 12, 2017

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.

Filtern nach:

126 - 136 von 136 Bewertungen für Graph Search, Shortest Paths, and Data Structures

von Rakshit G

Dec 17, 2016

Good learning

von Fan Y

May 01, 2018

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

von Nikola G

Jul 25, 2018

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.

von Jingxuan W

Aug 25, 2019

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.

von Christopher E

Sep 21, 2019

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.

von Nadanai L

Mar 30, 2019

Wonderful material but some issues with programming assignments which need updating

von Tianyi Z

Jul 16, 2018

The first programming assignment is just too bad.

von Joern K

Aug 30, 2018

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

von Michael B

Aug 07, 2017

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.

von Prasanna M R

Apr 05, 2017

good in depth knowedge.

von Divij S

Feb 23, 2018

Similar review as the first course.

1) Assignments 1 and 4 test your ability to write optimized code which can handle large input sets (1 million integers) more than knowledge of the algorithm itself. This would be fine except that there is no support or material for figuring this out. Assignment 1's solution as taught in the course, for the most part, does not work for that input size. It's a week of frustration trying to figure out how to handle that. I STILL don't have a proper solution for that problem.

2) NO support from staff/mentors/students in the forum, especially for those input size problems.

3) Quizzes tend to test maths knowledge not taught in the course too much - this is less the case in this second course than the first one

Probably not going to do the 3rd and 4th courses.