The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
提供方
算法 专项课程斯坦福大学课程信息
学生职业成果
27%
完成这些课程后已开始新的职业生涯
35%
通过此课程获得实实在在的工作福利
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
第 2 门课程（共 4 门）
可灵活调整截止日期
根据您的日程表重置截止日期。
中级
完成时间大约为15 小时
英语（English）
字幕：阿拉伯语（Arabic）, 法语（French）, （欧洲人讲的）葡萄牙语, 意大利语, 越南语, 德语（German）, 俄语（Russian）, 英语（English）, 西班牙语（Spanish）
您将获得的技能
GraphsData StructureAlgorithmsHash Table
学生职业成果
27%
完成这些课程后已开始新的职业生涯
35%
通过此课程获得实实在在的工作福利
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
第 2 门课程（共 4 门）
可灵活调整截止日期
根据您的日程表重置截止日期。
中级
完成时间大约为15 小时
英语（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
Breadth-first and depth-first search; computing strong components; applications.
完成时间为 4 小时
9 个视频 （总计 162 分钟）, 4 个阅读材料, 2 个测验
完成时间为 3 小时
Week 2
Dijkstra's shortest-path algorithm.
完成时间为 3 小时
4 个视频 （总计 79 分钟）, 2 个阅读材料, 2 个测验
完成时间为 4 小时
Week 3
Heaps; balanced binary search trees.
完成时间为 4 小时
9 个视频 （总计 142 分钟）, 1 个阅读材料, 2 个测验
完成时间为 5 小时
Week 4
Hashing; bloom filters.
完成时间为 5 小时
9 个视频 （总计 171 分钟）, 3 个阅读材料, 3 个测验
审阅
来自GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES的热门评论
由 CS 提供Apr 12, 2018
Good course, but instructor does start to move fast and a few walk-throughs in certain spots would be beneficial . However the lack of it makes you do your own research, which is also beneficial.
由 DS 提供Mar 29, 2020
Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.
由 TG 提供Nov 30, 2019
It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.
由 GM 提供May 21, 2018
assignments didn't seem as interesting or complex as class 1, besides week 1 of class 2. Lecture material was high quality however, and the advanced optional material is appreciated
关于 算法 专项课程
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.
常见问题
我什么时候能够访问课程视频和作业？
我订阅此专项课程后会得到什么？
Is financial aid available?
还有其他问题吗？请访问 学生帮助中心。
