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 학습자 리뷰 및 피드백

572개의 평가
69개의 리뷰

강좌 소개

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)....

최상위 리뷰


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.


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.

필터링 기준:

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them의 67개 리뷰 중 26~50

교육 기관: Astefanoaie N S

Feb 26, 2019

Nice course, a lot of information in short time. I think is need more time than 4 weeks to finish this course.

교육 기관: 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...

교육 기관: XinSen J

Dec 01, 2019

Great course in general, got the chance to dive a little deeper into the world of computer science.

교육 기관: Brande G

Jul 07, 2018

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

교육 기관: Yiming Z

Aug 13, 2018

Really happy to finish this specialization and I will still study algorithms in the future.

교육 기관: Pranjal V

Nov 23, 2017

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

교육 기관: Ankit B

Apr 30, 2017

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

교육 기관: Saurav M

Mar 23, 2019

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

교육 기관: Carole P

Feb 10, 2020

I really loved this course, and especially enjoyed the programming assignments.

교육 기관: bangchuan l

Jan 07, 2019

this course is harder than other 3 courses, but it is very worth to take it.

교육 기관: SHUKLA R J

Jul 24, 2017

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

교육 기관: Aishwarya R

Aug 04, 2019

NP complete problems, How to tackle such exponential time problems.

교육 기관: Jonathan H

May 19, 2018

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

교육 기관: Julius S

Jun 06, 2017

Good introductory coverage and challenging assignments.

교육 기관: Yinchu D

Mar 30, 2019

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

교육 기관: Thao N

Dec 15, 2018

Very challenging, but I learnt a lot from the course.

교육 기관: Derek K

Apr 22, 2018

nice challenging problems, good algo design practice

교육 기관: Aluisio R F d S

Feb 10, 2018

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

교육 기관: Yuanzhan W

May 19, 2019

Great course. The videos are very instructive.

교육 기관: Qiyue Z

Dec 03, 2017

Great professor and great course. I enjoy it!

교육 기관: Anthony N

Sep 25, 2017

Difficult, and completely worth the trouble.

교육 기관: Liankun Z

Dec 02, 2018

The Course is challenging and I like it

교육 기관: Simeon M

Nov 24, 2018

Excellent course, strongly recommended!

교육 기관: Dilyan M

Feb 06, 2019

Very challenging, but worthwhile.

교육 기관: Steven B

Mar 03, 2017

Very challenging, well presented.