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).
提供方
算法 专项课程斯坦福大学课程信息
16,105 次近期查看
可灵活调整截止日期
根据您的日程表重置截止日期。
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
第 4 门课程（共 4 门）
中级
完成时间大约为14 小时
英语（English）
字幕：阿拉伯语（Arabic）, 法语（French）, （欧洲人讲的）葡萄牙语, 意大利语, 越南语, 德语（German）, 俄语（Russian）, 英语（English）, 西班牙语（Spanish）
您将获得的技能
- Data Structure
- Algorithms
- Np-Completeness
- Dynamic Programming
可灵活调整截止日期
根据您的日程表重置截止日期。
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
第 4 门课程（共 4 门）
中级
完成时间大约为14 小时
英语（English）
字幕：阿拉伯语（Arabic）, 法语（French）, （欧洲人讲的）葡萄牙语, 意大利语, 越南语, 德语（German）, 俄语（Russian）, 英语（English）, 西班牙语（Spanish）
提供方
斯坦福大学
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.
授课大纲 - 您将从这门课程中学到什么
完成时间为 4 小时
Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.
完成时间为 4 小时
14 个视频 （总计 151 分钟）, 4 个阅读材料, 2 个测验
完成时间为 3 小时
Week 2
NP-complete problems and exact algorithms for them.
完成时间为 3 小时
11 个视频 （总计 122 分钟）, 2 个阅读材料, 2 个测验
完成时间为 2 小时
Week 3
Approximation algorithms for NP-complete problems.
完成时间为 2 小时
6 个视频 （总计 68 分钟）, 1 个阅读材料, 2 个测验
完成时间为 4 小时
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
完成时间为 4 小时
11 个视频 （总计 124 分钟）, 3 个阅读材料, 3 个测验
审阅
- 5 stars85.11%
- 4 stars13.05%
- 3 stars1.17%
- 2 stars0.52%
- 1 star0.13%
来自SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM的热门评论
由 JM 提供May 25, 2020
Challenging, but does a great job of presenting some important concepts at a high-level and showing where to continue learning.
由 YZ 提供Aug 12, 2018
Really happy to finish this specialization and I will still study algorithms in the future.
由 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.
由 KA 提供Dec 13, 2019
Great course, great explanation from instructor. I loved how Tim Roughgarden explains algorithms. Course Load was just right for me. Great experience!
关于 算法 专项课程
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.
常见问题
我什么时候能够访问课程视频和作业？
我订阅此专项课程后会得到什么？
有助学金吗？
还有其他问题吗？请访问 学生帮助中心。
