Chevron Left
返回到 Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

学生对 斯坦福大学 提供的 Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 的评价和反馈

4.8
499 个评分
61 个审阅

课程概述

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search)....

热门审阅

AA

Feb 28, 2017

This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.

AS

Aug 23, 2018

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.\n\nOne of the best courses I did on Coursera.

筛选依据:

26 - Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 的 50 个评论(共 59 个)

创建者 Minyue D

Jul 13, 2017

Awesone Course!!!!

创建者 李培春

Jun 24, 2017

Challenge course! Good course!

创建者 Sriram V

Jun 12, 2018

This was the hardest course in this specialization. But the quality of the course material and the instructor's way of explaining kept me engaged and motivated. The problems and the programming assignments were significantly harder than the earlier courses in this specialization - but it felt that much more satisfying after completing the course. Special thanks to Prof. Roughgarden for creating such an amazing course. :-)

创建者 Aluisio R F d S

Feb 10, 2018

One of the best courses I've ever taken! Congrats!!!

创建者 Richard H

Aug 14, 2017

Very challenging, but it just shows that you should never give up and keep believing in yourself! Thanks Prof. Tim for this excellent course. I do feel smarter than when I started, and had fun too (most of the time)!

创建者 Qiyue Z

Dec 03, 2017

Great professor and great course. I enjoy it!

创建者 Derek K

Apr 22, 2018

nice challenging problems, good algo design practice

创建者 Sanket S

Jul 10, 2017

good

创建者 Johnathan F

Jan 14, 2018

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

创建者 Yuxiao W

Mar 04, 2018

unlike previous 3 courses

some of course 4's quiz problems are really difficult and not sure how to approach...

创建者 Luiz C

May 02, 2018

Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!

创建者 Pranjal V

Nov 23, 2017

Thank you do much, this has been an amazing journey! Best Algorithms course online 11/10!

创建者 SHUKLA R J

Jul 24, 2017

This is the most challenging course of all the courses in the specialization

创建者 Xiaokang W

Jul 23, 2017

I really love this course. What the professor said was just to the points he wanted to convey and no not-related sentences. He controlled extremely well about to what level of details to unfold. Last but not least, he adds complexity of problems gradually. I saw he taught a follow-up course at Stanford and I can watch the videos on Youtube. If the course were on Coursera, I would take it.

创建者 John W

Nov 19, 2017

It took me a while to get through all four of these courses, but definitely worth the effort! Really stretched my brain, and I feel like I could have gotten even more had I spent more time on the theoretical bits.

创建者 Ankit B

Apr 30, 2017

Thoroughly enjoyed this course! Problems and assignments are quite challenging but doable

创建者 Steven B

Mar 03, 2017

Very challenging, well presented.

创建者 Richard P

Jan 07, 2018

This has been a tough but very rewarding learning experience, and that includes the entire series of four courses. You learn to really appreciate Tim, who is the instructor, for his passion and care about teaching the material to his students. The homework assignments can be a lot of work, but also can be quite interesting. The discussion forums are very helpful for the assignments. Thanks for the great learning experience and the wonderful effort.

创建者 Jonathan H

May 19, 2018

One of the best specializations on this site. Highly recommended!

创建者 zhangdi

Dec 06, 2017

Stanford神课,占坑留名。4/4

创建者 dynasty919

Mar 14, 2018

tough course

创建者 Brande G

Jul 07, 2018

Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.

创建者 Saurav M

Mar 23, 2019

good course give deep insight of algorithms esp knapsack, nearest neighbor algorithm

创建者 Yinchu D

Mar 30, 2019

Well... I cannot believe I did it!!! Love this course!

创建者 Yuanzhan W

May 19, 2019

Great course. The videos are very instructive.