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:

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

por Ryan J S

9 de jun de 2020

Excellent course, especially for a person without a computer science tertiary education. Having finished the course and the specialisation I can say that it is definitely worth all the blood sweat and tears required to make it through the content.

por Richard H

13 de ago de 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)!

por John W

19 de nov de 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.

por Ravishankar J

14 de ago de 2017

A great course with great assignments. Assignments really test your implementation skills as well as research skills. One should really use forums to ask doubts and give answers to solve these assignments.

por Abhit

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

por Charles H

19 de fev de 2019

The examinations are sometimes very challenging, but at least you learn a lot of things !

Completing this course will definitely make you improve a lot your skills in programming.

por Ashish S

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

por Dustin Z

16 de fev de 2021

Really great and challenging course. Gives a strong foundation in np-complete problems and the approximate methods for making progress on these challenging problems.

por tao L

5 de mar de 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.

por Kaan A

14 de dez de 2019

Great course, great explanation from instructor. I loved how Tim Roughgarden explains algorithms. Course Load was just right for me. Great experience!

por Johnathan F

14 de jan de 2018

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

por Himanshu P

6 de mai de 2020

learn a lot about algorithmic complexity class and lot's of such a beautiful algorithm. Thank you sir for sharing your knowledge with us.

por Steven W

10 de ago de 2020

Excellent course! The lectures provide clear and rigorous explanations, and the coding exercises are appropriately challenging.

por Jonathan M

26 de mai de 2020

Challenging, but does a great job of presenting some important concepts at a high-level and showing where to continue learning.

por Luiz C

2 de mai de 2018

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

por Yosef A

26 de fev de 2021

Wonderful lectures and programming exercises. Professor Roughgarden explains difficult concepts in the simplest way possible.

por Shubham A

16 de mar de 2020

A really well-crafted specialization. Has something for everyone from a beginner to an advanced Computer Science student.

por Nicolae S A

25 de fev de 2019

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

por Yuxiao W

4 de mar de 2018

unlike previous 3 courses

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

por Masashi K

2 de nov de 2020

Thanks very much for providing this excellent course! It was tough to complete but worth challenging.

por Michael j

30 de nov de 2019

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

por Brande G

7 de jul de 2018

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

por Prince C S

9 de set de 2021

Great Pace - good examples - always going to the point - clear and providing good information.

por Yiming Z

13 de ago de 2018

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

por Ankit B

29 de abr de 2017

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