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).
提供方
课程信息
67,938 次近期查看
学生职业成果
41%
完成这些课程后已开始新的职业生涯
48%
通过此课程获得实实在在的工作福利
您将获得的技能
GraphsData StructureAlgorithmsHash Table
学生职业成果
41%
完成这些课程后已开始新的职业生涯
48%
通过此课程获得实实在在的工作福利
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
第 2 门课程（共 4 门）
可灵活调整截止日期
根据您的日程表重置截止日期。
中级
完成时间大约为18 小时
建议：4 weeks of study, 4-8 hours/week
英语（English）
字幕：英语（English）
提供方
斯坦福大学
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 个测验
9 个视频
Breadth-First Search (BFS): The Basics14分钟
BFS and Shortest Paths7分钟
BFS and Undirected Connectivity13分钟
Depth-First Search (DFS): The Basics7分钟
Topological Sort21分钟
Computing Strong Components: The Algorithm29分钟
Computing Strong Components: The Analysis26分钟
Structure of the Web [Optional]18分钟
4 个阅读材料
Week 1 Overview10分钟
Overview, Resources, and Policies10分钟
Lecture slides10分钟
Optional Theory Problems (Week 1)10分钟
2 个练习
Problem Set #110分钟
Programming Assignment #12分钟
完成时间为 2 小时
Week 2
Dijkstra's shortest-path algorithm.
完成时间为 2 小时
4 个视频 （总计 79 分钟）, 2 个阅读材料, 2 个测验
4 个视频
Dijkstra's Algorithm: Examples12分钟
Correctness of Dijkstra's Algorithm19分钟
Dijkstra's Algorithm: Implementation and Running Time26分钟
2 个阅读材料
Week 2 Overview10分钟
Optional Theory Problems (Week 2)10分钟
2 个练习
Problem Set #210分钟
Programming Assignment #22分钟
完成时间为 3 小时
Week 3
Heaps; balanced binary search trees.
完成时间为 3 小时
9 个视频 （总计 142 分钟）, 1 个阅读材料, 2 个测验
9 个视频
Heaps: Operations and Applications18分钟
Heaps: Implementation Details [Advanced - Optional]20分钟
Balanced Search Trees: Operations and Applications10分钟
Binary Search Tree Basics, Part I13分钟
Binary Search Tree Basics, Part II30分钟
Red-Black Trees21分钟
Rotations [Advanced - Optional]7分钟
Insertion in a Red-Black Tree [Advanced]14分钟
1 个阅读材料
Week 3 Overview10分钟
2 个练习
Problem Set #310分钟
Programming Assignment #32分钟
完成时间为 4 小时
Week 4
Hashing; bloom filters.
完成时间为 4 小时
9 个视频 （总计 171 分钟）, 3 个阅读材料, 3 个测验
9 个视频
Hash Tables: Implementation Details, Part I18分钟
Hash Tables: Implementation Details, Part II22分钟
Pathological Data Sets and Universal Hashing Motivation21分钟
Universal Hashing: Definition and Example [Advanced - Optional]25分钟
Universal Hashing: Analysis of Chaining [Advanced - Optional]18分钟
Hash Table Performance with Open Addressing [Advanced - Optional]15分钟
Bloom Filters: The Basics15分钟
Bloom Filters: Heuristic Analysis13分钟
3 个阅读材料
Week 4 Overview10分钟
Optional Theory Problems (Week 4)10分钟
Info and FAQ for final exam10分钟
3 个练习
Problem Set #410分钟
Programming Assignment #42分钟
Final Exam20分钟
审阅
4.8
来自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.
About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.
常见问题
我什么时候能够访问课程视频和作业？
注册以便获得证书后，您将有权访问所有视频、测验和编程作业（如果适用）。只有在您的班次开课之后，才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程，可能无法访问某些作业。
我订阅此专项课程后会得到什么？
您注册课程后，将有权访问专项课程中的所有课程，并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中，您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容，可以免费旁听课程。
退款政策是如何规定的？
有助学金吗？
还有其他问题吗？请访问 学生帮助中心。