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

Good learning

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

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.

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.

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.

Wonderful material but some issues with programming assignments which need updating

The first programming assignment is just too bad.

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

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.

good in depth knowedge.

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.