Chevron Left
Back to Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Learner Reviews & Feedback for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them by Stanford University

4.8
stars
764 ratings

About the Course

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

Top reviews

AA

Feb 27, 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 22, 2018

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.

One of the best courses I did on Coursera.

Filter by:

51 - 75 of 103 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

By Saurav M

Mar 23, 2019

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

By Golu K

Jun 1, 2022

it's was nice experience. this is very awesome course also instructor is very good.

By shivaranjani g

Jun 18, 2021

Learn lot of things from this course. Good example, quiz, programming assignment.

By Kevin H

Oct 29, 2020

Great Course for really diving into data structures and algorithms. Thanks Tim!

By Carole P

Feb 9, 2020

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

By Hrithwik S

Apr 8, 2020

A course that truly tests you're limits, in knowledge and skills, A must take

By bangchuan l

Jan 6, 2019

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

By Ronak S

Jul 24, 2017

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

By Harlan G

Sep 10, 2020

A challenging course. Good stuff. Learnt a lot of new things. Thank you!!

By 吳俊輝

Apr 1, 2021

Great Course! Learned A LOT in problem and programming assignment!!

By Aishwarya R

Aug 4, 2019

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

By Jonathan H

May 19, 2018

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

By Julius S

Jun 6, 2017

Good introductory coverage and challenging assignments.

By Yinchu D

Mar 30, 2019

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

By Thao N

Dec 15, 2018

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

By Derek K

Apr 22, 2018

nice challenging problems, good algo design practice

By Aluisio R F d S

Feb 10, 2018

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

By Yuanzhan W

May 19, 2019

Great course. The videos are very instructive.

By Yuxuan ( G

May 28, 2020

Thank you Prof. Roughgarden! Until next time!

By Qiyue Z

Dec 2, 2017

Great professor and great course. I enjoy it!

By Anthony N

Sep 25, 2017

Difficult, and completely worth the trouble.

By LK Z

Dec 1, 2018

The Course is challenging and I like it

By Simeon M

Nov 24, 2018

Excellent course, strongly recommended!

By Dilyan M

Feb 6, 2019

Very challenging, but worthwhile.

By Steven B

Mar 3, 2017

Very challenging, well presented.