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
827 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

TL

Mar 4, 2018

Thanks a lot. It is time consuming, need a lot of thinking and practising to finish the homework. And it is worth taking. After this, we can go deep into cs.

JF

Jan 13, 2018

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

Filter by:

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

By Yiming Z

Aug 13, 2018

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

By Ankit B

Apr 29, 2017

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

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 A K

Apr 22, 2018

nice challenging problems, good algo design practice

By Aluisio 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 Huan L

Apr 11, 2023

It's hard and rewarding at the same time!!!

By LK Z

Dec 1, 2018

The Course is challenging and I like it