Kursteilnehmer-Bewertung und -Feedback für Shortest Paths Revisited, NP-Complete Problems and What To Do About Them von Stanford University
Über den Kurs
Top-Bewertungen
AA
Feb 28, 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
Aug 23, 2018
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.
51 - 71 von 71 Bewertungen für Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
von Dilyan M
•Feb 06, 2019
Very challenging, but worthwhile.
von Steven B
•Mar 03, 2017
Very challenging, well presented.
von 李培春
•Jun 24, 2017
Challenge course! Good course!
von Samuel E
•Mar 12, 2020
That was awesome, thank you!
von Thomas S
•Jan 25, 2018
Nice Lessons, nice Grades!
von Tsogtbayar N
•Sep 11, 2017
Thanks for the instructor.
von Anton B
•Jan 19, 2019
Tim, thank you very much!
von Sui X
•Jun 11, 2019
wow, such an good course
von zhangdi
•Dec 06, 2017
Stanford神课，占坑留名。4/4
von Jianghua F
•Jan 29, 2018
Insightful course!
von Minyue D
•Jul 13, 2017
Awesone Course!!!!
von biswa
•Nov 11, 2018
Great material!
von Madhurya R
•Sep 03, 2019
Great course
von dynasty919
•Mar 14, 2018
tough course
von Sanket S
•Jul 10, 2017
good
von Aleksandar
•Mar 05, 2019
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.
von Putcha L N R
•Jun 25, 2018
Great one for people with advanced understanding! Others will find it slightly hard to follow!
von Marko D
•Mar 25, 2020
Course is short for the topic complexity
von Zihan H
•May 03, 2018
diffcult
von Nguyen K T
•Sep 15, 2019
so hard
von Xiao Z
•Aug 17, 2019
Can be expanded more. Some of the quizzes are too hard.
