Tim Roughgarden
9.1/10
(Our Score)
Product is rated as #17 in category Data Structures and Algorithms
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). 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.
Instructor Details
Votes: 0
Courses : 5
Specification: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
|
51 reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Show all
Most Helpful
Highest Rating
Lowest Rating
Add a review
| Price | Free |
|---|---|
| Provider | |
| Duration | 19 hours |
| Year | 2017 |
| Level | Intermediate |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
FREE
John W –
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.
Pranjal V –
Thank you do much, this has been an amazing journey! Best Algorithms course online 11/10!
Qiyue Z –
Great professor and great course. I enjoy it!
Richard P –
This has been a tough but very rewarding learning experience, and that includes the entire series of four courses. You learn to really appreciate Tim, who is the instructor, for his passion and care about teaching the material to his students. The homework assignments can be a lot of work, but also can be quite interesting. The discussion forums are very helpful for the assignments. Thanks for the great learning experience and the wonderful effort.
Johnathan F –
I love Tim’s excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
Thomas S –
Nice Lessons, nice Grades!
Jianghua F –
Insightful course!
Aluisio R F d S –
One of the best courses I’ve ever taken! Congrats!!!
Yuxiao W –
unlike previous 3 courses some of course 4’s quiz problems are really difficult and not sure how to approach…
tao L –
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.
dynasty919 –
tough course
Derek K –
nice challenging problems, good algo design practice
Luiz C –
Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!
Zihan H –
diffcult
Jonathan H –
One of the best specializations on this site. Highly recommended!
Cindy T –
This was definitely a challenging yet extremely rewarding experience. The lectures were top notch. In fact I was taking another algorithms course at the time, but I felt it lacked the necessary proofs and in my opinion just jumped to the conclusion. I tried listening to the lectures from this course and immediately switched over. The projects also trained me to use efficient data structures and be aware of memory management. The quizzes also required in depth understanding of the material, while the discussion forums provided lots useful hints in that regard. Overall, it’s definitely a good use of time and I’m glad I completed the entire specialization!
Sriram V –
This was the hardest course in this specialization. But the quality of the course material and the instructor’s way of explaining kept me engaged and motivated. The problems and the programming assignments were significantly harder than the earlier courses in this specialization but it felt that much more satisfying after completing the course. Special thanks to Prof. Roughgarden for creating such an amazing course. : )
Putcha L N R –
Great one for people with advanced understanding! Others will find it slightly hard to follow!
Jakub C –
A very nice introduction to algorithms from a high level mathematical perspective. This course is great for building intuition about key concepts. Highly recommended. I did the Princeton algorithms course first. Both are great. The first tests one more on the implementation side and requires Java. This course is more focused on theory and a great complement. Too bad there is not a Part 5, 6, &.
Brande G –
Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.
Yiming Z –
Really happy to finish this specialization and I will still study algorithms in the future.
Ashish D S –
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.
biswa –
Great material!
Simeon M –
Excellent course, strongly recommended!
Liankun Z –
The Course is challenging and I like it
Thao N –
Very challenging, but I learnt a lot from the course.
Yusuke U –
There were countless challenging and stressful moments during this specialization for me because I didn’t have any CS knowledge or experience before. But, all in all, it totally worth it, a lot of learning and aha moments involved while torturing myself. I definitely recommend this course to everyone who want to dip their toes into CS world.
bangchuan l –
this course is harder than other 3 courses, but it is very worth to take it.
Anton B –
Tim, thank you very much!
Dilyan M –
Very challenging, but worthwhile.
Jemaal K –
Tim has done a real fantastic job distilling the conceptual and mathematical proofs of some of the most prolific computational algorithms that drive our technological society today. Even though I’m a seasoned programmer, I am now more comfortable discussing algorithmic analysis and design far beyond what I learned during my undergrad studies.
Charles H –
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.
Astefanoaie N S –
Nice course, a lot of information in short time. I think is need more time than 4 weeks to finish this course.
Aleksandar –
Significantly more challenging when compared to the courses 1 to 3. ) I highly recommend this course, but people who are about to take this course should be aware that they will probably have to spend a bit more time.
Saurav M –
good course give deep insight of algorithms esp knapsack, nearest neighbor algorithm
Yinchu D –
Well… I cannot believe I did it!!! Love this course!
Yuanzhan W –
Great course. The videos are very instructive.
Sui X –
wow, such an good course
Aishwarya R –
NP complete problems, How to tackle such exponential time problems.
Xiao Z –
Can be expanded more. Some of the quizzes are too hard.
Madhurya R –
Great course
Nguyen K T –
so hard
Toshikazu Y –
Great specialization to learn algorithms from zero to hero. Having a mathematical background, I found the explanations and the proofs in the lectures crystal clear throughout the entire specialization. Some quizzes and programming exercises were challenging but enjoyable.
Minsub L –
very interesting course in Algorithms Specialization. It is sufficient to arouse interest in studying advance algorithm. Thank you for your teaching, Professor Tim.
XinSen J –
Great course in general, got the chance to dive a little deeper into the world of computer science.
Kaan A –
Great course, great explanation from instructor. I loved how Tim Roughgarden explains algorithms. Course Load was just right for me. Great experience!
Jephte E –
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.
Besher A M –
Very challenging course, but it’s very rewarding and highly recommended for anyone looking to learn more about algorithms. I don’t have a CS background, so I really appreciated the knowledge that I gained from the course. It helped me build the intuition to reason about algorithms and learn how to design/use them, which is something I was sorely lacking before.
Yixian H –
That should be the best algorithm course i have ever known way better than what I take in a graduate school. The discussion form is very useful every time there is some guy figure out a brilliant solution to conquer the problem. Thanks Prof. Roughgarden for the wonderful experience he brings to us!
Carole P –
I really loved this course, and especially enjoyed the programming assignments.
Marko D –
Course is short for the topic complexity