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
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.
76 — 93 de 93 Avaliações para o Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
por Minyue D
•Awesone Course!!!!
por Ajit C B
•Terrific course!
por biswa
•Great material!
por Dinghan X
•Great Course
por Madhurya R
•Great course
por dynasty919
•tough course
por Zhiping L
•excellent！
por Ahmad e D
•🔥🔥🔥🔥
por Sanket S
•good
por Nikeshkin L E
•The course is great, it both challenging and interesting. The only one thing that I was lacking is visualisation. A lot of information/parts of algorithms explanations/theorem proofs is passed verbally and considering not triviality of that information it's hard to perceive and understand that without proper visualisation (algorithms animation/schemes/diagrams etc.).
por Oleksandr S
•Totally the course and specialization are awesome. In this course, the explanation sometimes wasn't enough for such complex problems. At least I understood where I hare a rather big lack of knowledge and need to get the new courses.
por 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.
por Putcha L N R
•Great one for people with advanced understanding! Others will find it slightly hard to follow!
por Marko D
•Course is short for the topic complexity
por Zihan H
•diffcult
por Thành N K
•so hard
por Rúben G
•From the entire specialization, this course was the most difficult for me. I am giving less stars on this one just because I believe there was a detail on the TSP Dynamic Programming solution that was seen for the first time on the entire specialization and it was not offered proper explanation for how to approach it. Namely, the part of 2-D array indexed by subsets. I really struggled with this aspect during the implementation and I had to do additional research where I found the concept of PowerSet and how to use bit manipulation to represent power sets.
por Xiao Z
•Can be expanded more. Some of the quizzes are too hard.
Coursera Footer
