学生对 加州大学圣地亚哥分校 提供的 Algorithms on Graphs 的评价和反馈

Course instructors did not reply my questions on a discussion forum! I did not have any help from them, they are very passive.

This course was an exceptional installment to this Algorithms track. While the problems in this course required less creativity to answer than did those of the antecedent courses, they did test the student's ability to logically, cleanly, and efficiently apply the algorithms and ideas presented in lecture. As always, the instruction was stellar and every piece of pertinent information for answering all problems was included in the instructions. Excellent course.

This course took a bit more time than previous courses of the specialisation. It taught me everything about basics of algorithms. The last week was optional but it was the best, toughest and the best week of the course. It taught about fast traversal of graph and that concept of contraction hierchies was awesome and mind messing too.

This was a great journey. In this journey I learnt a lot. This is best course ever.

The course itself is wonderful. I liked the challenges provided in this a lot. The information is provided in very short, clear and full enough manner (all claims are proved and proved are great and very clean). There was only one thing that disappointed me a bit: on the last week I couldn't find the tasks description and had to download it somewhere from the Internet thankfully the forum's students.

exceptional very nice course. But we need to religiously follow the videos and materials

Great explanation of basic graph algorithms (week 1-5). However content of week 6 gives more questions than answers and should be improved.

Need more graphical illustrations with colors when explaiing complex details

Great Course to learn fundamentals of Graph Algorithms.

The lecturers could have done a better job in presenting the contents. For some of them, the tone is always monotonous. Also regarding the Bellman Ford's algorithm, it would be more helpful if the lecturer discusses the impact of the sequence of the edges to the running time.

The course is good, assessments were challenging. However, I did not like using of USSR map in second week lectures.

The video lectures are bdaly illustrated. It is very hard to follow. It is better to read books.

There is no pdf for week five exercise.

The forums are dead and no support is provided by the instructors. They're just pocketing our money and doing bugger all.

Besides that, it is a well-designed course with some easy and some more challenging assignments.

I can only give this two stars at most.

The lecturers are just like reading the PPT without any heuristic teaching approaches.

The assignments make me desperate, always show very poor feedback message -- "Wrong answer", even the cases failed because of performance issue.

The starter files given from the assignment are inconsistent with the pdf description. It's so confusing.

Couldn't get any help from forums.

The teaching quality is very average and mediocre at best.

The assignments are merely implementation of lectures .

The Stanford and Princeton courses on Algorithms are better courses to take for one to pursue a serious study of Algorithms.

The course is too shallow - amount of topics discusses is quite small. Practice tasks are boring - implement pseudocode given in lectures. No quizzes. In particular you can see that it is a bad course, if you compare it to the previous 2 courses in the specialization. I'm agree with other people posting in forums about that.

Wasted time, could spend that month more productively. Not going to continue passing other future courses.

Heaps of new material to learn

very enjoyable course.

Most fun course in the series

Optional part is very good, gives a lot of practical problems to solve.

One of the best courses I have ever taken !

thanks for providing the amazing courses

Exceptionally good course. Basics covered here stand the test of even the toughest hackathons.

Useful