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

Comentários e feedback de alunos de Shortest Paths Revisited, NP-Complete Problems and What To Do About Them da instituição Universidade de Stanford

4.8
estrelas
764 classificações

Sobre o curso

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

Melhores avaliações

AA

27 de fev de 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

22 de ago de 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.

Filtrar por:

51 — 75 de 103 Avaliações para o Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

por Saurav M

23 de mar de 2019

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

por Golu K

1 de jun de 2022

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

por shivaranjani g

18 de jun de 2021

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

por Kevin H

29 de out de 2020

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

por Carole P

9 de fev de 2020

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

por Hrithwik S

8 de abr de 2020

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

por bangchuan l

6 de jan de 2019

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

por Ronak S

24 de jul de 2017

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

por Harlan G

10 de set de 2020

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

por 吳俊輝

1 de abr de 2021

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

por Aishwarya R

4 de ago de 2019

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

por Jonathan H

19 de mai de 2018

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

por Julius S

6 de jun de 2017

Good introductory coverage and challenging assignments.

por Yinchu D

30 de mar de 2019

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

por Thao N

15 de dez de 2018

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

por Derek K

22 de abr de 2018

nice challenging problems, good algo design practice

por Aluisio R F d S

10 de fev de 2018

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

por Yuanzhan W

19 de mai de 2019

Great course. The videos are very instructive.

por Yuxuan ( G

28 de mai de 2020

Thank you Prof. Roughgarden! Until next time!

por Qiyue Z

2 de dez de 2017

Great professor and great course. I enjoy it!

por Anthony N

25 de set de 2017

Difficult, and completely worth the trouble.

por LK Z

1 de dez de 2018

The Course is challenging and I like it

por Simeon M

24 de nov de 2018

Excellent course, strongly recommended!

por Dilyan M

6 de fev de 2019

Very challenging, but worthwhile.

por Steven B

3 de mar de 2017

Very challenging, well presented.