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).
提供方
課程信息
您將獲得的技能
- Graphs
- Data Structure
- Algorithms
- Hash Table
提供方

斯坦福大学
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.
授課大綱 - 您將從這門課程中學到什麼
Week 1
Breadth-first and depth-first search; computing strong components; applications.
Week 2
Dijkstra's shortest-path algorithm.
Week 3
Heaps; balanced binary search trees.
Week 4
Hashing; bloom filters.
審閱
- 5 stars86.25%
- 4 stars11.46%
- 3 stars1.69%
- 2 stars0.21%
- 1 star0.36%
來自GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES的熱門評論
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
Excellent video lectures. Great forums that discuss the problems and programming assignments. Challenging material, with satisfying rewards on finding solutions.
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.
關於 算法 專項課程
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.

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