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.18%
- 4 stars11.55%
- 3 stars1.68%
- 2 stars0.21%
- 1 star0.36%
来自GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES的热门评论
Tim really did an awesome job preparing the lectures for this course. Material was presented quickly, efficiently, and engagingly. I highly recommend this class.
Very useful information for thorough programmers. Especially liked analysis of hash tables implementation and handling collisions in real applications.
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.
Hope the professor could teach more about hashing and give a detailed implementation of some data structures or supply some interface template code.
关于 算法 专项课程
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.

常见问题
我什么时候能够访问课程视频和作业?
我订阅此专项课程后会得到什么?
有助学金吗?
还有其他问题吗?请访问 学生帮助中心。