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).
- 5 stars
- 4 stars
- 3 stars
- 2 stars
- 1 star
來自SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM的熱門評論
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.
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.
very interesting course in Algorithms Specialization.\n\nIt is sufficient to arouse interest in studying advance algorithm.\n\nThank you for your teaching, Professor Tim.
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
Great course, great explanation from instructor. I loved how Tim Roughgarden explains algorithms. Course Load was just right for me. Great experience!
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!
A really well-crafted specialization. Has something for everyone from a beginner to an advanced Computer Science student.
unlike previous 3 courses\n\nsome of course 4's quiz problems are really difficult and not sure how to approach...
Nice course, a lot of information in short time. I think is need more time than 4 weeks to finish this course.
Great course in general, got the chance to dive a little deeper into the world of computer science.
Great one for people with advanced understanding! Others will find it slightly hard to follow!
Really happy to finish this specialization and I will still study algorithms in the future.
Thank you do much, this has been an amazing journey! Best Algorithms course online 11/10!
Thoroughly enjoyed this course! Problems and assignments are quite challenging but doable
good course give deep insight of algorithms esp knapsack, nearest neighbor algorithm
this course is harder than other 3 courses, but it is very worth to take it.
This is the most challenging course of all the courses in the specialization
NP complete problems, How to tackle such exponential time problems.
Good introductory coverage and challenging assignments.
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
關於 算法 專項課程