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).
提供方
提供方
授課大綱 - 您將從這門課程中學到什麼
Week 1
Week 2
Week 3
Week 4
審閱
- 5 stars86.17%
- 4 stars11.48%
- 3 stars1.71%
- 2 stars0.25%
- 1 star0.36%
來自GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES的熱門評論
The course was very interesting. As a person who struggles with problem-solving, I found this course very helpful because the professor's ideas are well explained. It makes me to learn more.
Very useful information for thorough programmers. Especially liked analysis of hash tables implementation and handling collisions in real applications.
Learning algorithms is a must for all computer scientists. This course propels you on the path and kindles the spirit of inquiry and knack for finding better solutions.
There is very little hand-holding in this course and no code provided. This really challenges you to implement the ideas taught in the most efficient and appropriate manner possible.
關於 算法 專項課程

常見問題
我什么时候能够访问课程视频和作业?
我订阅此专项课程后会得到什么?
有助学金吗?
還有其他問題嗎?請訪問 學生幫助中心。