Chevron Left
返回到 Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

学生对 Stanford University 提供的 Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 的评价和反馈

4.8
827 个评分

课程概述

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)....

热门审阅

AA

Feb 27, 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 22, 2018

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.

筛选依据:

51 - Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 的 75 个评论(共 112 个)

创建者 Yiming Z

Aug 12, 2018

Really happy to finish this specialization and I will still study algorithms in the future.

创建者 Ankit B

Apr 29, 2017

Thoroughly enjoyed this course! Problems and assignments are quite challenging but doable

创建者 Saurav M

Mar 23, 2019

good course give deep insight of algorithms esp knapsack, nearest neighbor algorithm

创建者 Golu K

Jun 1, 2022

it's was nice experience. this is very awesome course also instructor is very good.

创建者 shivaranjani g

Jun 18, 2021

Learn lot of things from this course. Good example, quiz, programming assignment.

创建者 Kevin H

Oct 29, 2020

Great Course for really diving into data structures and algorithms. Thanks Tim!

创建者 Carole P

Feb 9, 2020

I really loved this course, and especially enjoyed the programming assignments.

创建者 Hrithwik S

Apr 8, 2020

A course that truly tests you're limits, in knowledge and skills, A must take

创建者 Bangchuan L

Jan 6, 2019

this course is harder than other 3 courses, but it is very worth to take it.

创建者 Ronak S

Jul 23, 2017

This is the most challenging course of all the courses in the specialization

创建者 Harlan G

Sep 10, 2020

A challenging course. Good stuff. Learnt a lot of new things. Thank you!!

创建者 吳俊輝

Apr 1, 2021

Great Course! Learned A LOT in problem and programming assignment!!

创建者 Aishwarya R

Aug 3, 2019

NP complete problems, How to tackle such exponential time problems.

创建者 Jonathan H

May 19, 2018

One of the best specializations on this site. Highly recommended!

创建者 Julius S

Jun 6, 2017

Good introductory coverage and challenging assignments.

创建者 Yinchu D

Mar 30, 2019

Well... I cannot believe I did it!!! Love this course!

创建者 Thao N

Dec 15, 2018

Very challenging, but I learnt a lot from the course.

创建者 Derek A K

Apr 22, 2018

nice challenging problems, good algo design practice

创建者 Aluisio S

Feb 10, 2018

One of the best courses I've ever taken! Congrats!!!

创建者 Yuanzhan W

May 19, 2019

Great course. The videos are very instructive.

创建者 Yuxuan ( G

May 28, 2020

Thank you Prof. Roughgarden! Until next time!

创建者 Qiyue Z

Dec 2, 2017

Great professor and great course. I enjoy it!

创建者 Anthony N

Sep 25, 2017

Difficult, and completely worth the trouble.

创建者 Huan L

Apr 11, 2023

It's hard and rewarding at the same time!!!

创建者 LK Z

Dec 1, 2018

The Course is challenging and I like it