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).
提供方
課程信息
57,235 次近期查看
學生職業成果
41%
完成這些課程後已開始新的職業生涯
48%
通過此課程獲得實實在在的工作福利
您將獲得的技能
GraphsData StructureAlgorithmsHash Table
學生職業成果
41%
完成這些課程後已開始新的職業生涯
48%
通過此課程獲得實實在在的工作福利
100% 在線
立即開始，按照自己的計劃學習。
第 2 門課程（共 4 門）
可靈活調整截止日期
根據您的日程表重置截止日期。
中級
完成時間大約為18 小時
建議：4 weeks of study, 4-8 hours/week
英語（English）
字幕：英語（English）
教學大綱 - 您將從這門課程中學到什麼
完成時間為 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.
由 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
由 JA 提供Oct 15, 2018
Interesting problems and explanations. But mathematical analysis is going off of my mind. It has very good explanation. Not sure, whether I can carry forward that knowledge or not.
提供方
斯坦福大学
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.
關於 算法 專項課程
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.
常見問題
我什么时候能够访问课程视频和作业？
注册以便获得证书后，您将有权访问所有视频、测验和编程作业（如果适用）。只有在您的班次开课之后，才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程，可能无法访问某些作业。
我订阅此专项课程后会得到什么？
您注册课程后，将有权访问专项课程中的所有课程，并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中，您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容，可以免费旁听课程。
退款政策是如何规定的？
有助学金吗？
還有其他問題嗎？請訪問 學生幫助中心。
