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
Sobre o curso
Melhores avaliações
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 — 59 de {totalReviews} Avaliações para o Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
por Sui X
•Jun 11, 2019
wow, such an good course
por Aishwarya R
•Aug 04, 2019
NP complete problems, How to tackle such exponential time problems.
por Madhurya R
•Sep 03, 2019
Great course
por 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.
por Putcha L N R
•Jun 25, 2018
Great one for people with advanced understanding! Others will find it slightly hard to follow!
por Subodh C
•Sep 25, 2017
Need more explanatory answer sets.
por Zihan H
•May 03, 2018
diffcult
por Nguyen K T
•Sep 15, 2019
so hard
por Xiao Z
•Aug 17, 2019
Can be expanded more. Some of the quizzes are too hard.
