Coursera
探索
  • 浏览
  • 搜索
  • 企业版
  • 登录
  • 注册

Graph Search, Shortest Paths, and Data Structures

总览授课大纲常见问题解答制作方价格评分和审阅

主页计算机科学算法

Graph Search, Shortest Paths, and Data Structures

斯坦福大学

关于此课程: 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).

此课程适用人群: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.


制作方:  斯坦福大学
斯坦福大学

  • Tim Roughgarden

    教学方:  Tim Roughgarden, Professor

    Computer Science
基本信息
课程 2(共 4 门,Algorithms Specialization )
级别Intermediate
承诺学习时间4 weeks of study, 4-8 hours/week
语言
English
如何通过通过所有计分作业以完成课程。
用户评分
4.8 星
平均用户评分 4.8查看学生的留言
授课大纲
第 1 周
Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 视频, 4 阅读材料
  1. Reading: Week 1 Overview
  2. Reading: Overview, Resources, and Policies
  3. Reading: Lecture slides
  4. 视频: Graph Search - Overview
  5. 视频: Breadth-First Search (BFS): The Basics
  6. 视频: BFS and Shortest Paths
  7. 视频: BFS and Undirected Connectivity
  8. 视频: Depth-First Search (DFS): The Basics
  9. 视频: Topological Sort
  10. 视频: Computing Strong Components: The Algorithm
  11. 视频: Computing Strong Components: The Analysis
  12. 视频: Structure of the Web [Optional]
  13. Reading: Optional Theory Problems (Week 1)
已评分: Problem Set #1
已评分: Programming Assignment #1
第 2 周
Week 2
Dijkstra's shortest-path algorithm.
4 视频, 2 阅读材料
  1. Reading: Week 2 Overview
  2. 视频: Dijkstra's Shortest-Path Algorithm
  3. 视频: Dijkstra's Algorithm: Examples
  4. 视频: Correctness of Dijkstra's Algorithm
  5. 视频: Dijkstra's Algorithm: Implementation and Running Time
  6. Reading: Optional Theory Problems (Week 2)
已评分: Problem Set #2
已评分: Programming Assignment #2
第 3 周
Week 3
Heaps; balanced binary search trees.
9 视频, 1 阅读材料
  1. Reading: Week 3 Overview
  2. 视频: Data Structures: Overview
  3. 视频: Heaps: Operations and Applications
  4. 视频: Heaps: Implementation Details [Advanced - Optional]
  5. 视频: Balanced Search Trees: Operations and Applications
  6. 视频: Binary Search Tree Basics, Part I
  7. 视频: Binary Search Tree Basics, Part II
  8. 视频: Red-Black Trees
  9. 视频: Rotations [Advanced - Optional]
  10. 视频: Insertion in a Red-Black Tree [Advanced]
已评分: Problem Set #3
已评分: Programming Assignment #3
第 4 周
Week 4
Hashing; bloom filters.
9 视频, 3 阅读材料
  1. Reading: Week 4 Overview
  2. 视频: Hash Tables: Operations and Applications
  3. 视频: Hash Tables: Implementation Details, Part I
  4. 视频: Hash Tables: Implementation Details, Part II
  5. 视频: Pathological Data Sets and Universal Hashing Motivation
  6. 视频: Universal Hashing: Definition and Example [Advanced - Optional]
  7. 视频: Universal Hashing: Analysis of Chaining [Advanced - Optional]
  8. 视频: Hash Table Performance with Open Addressing [Advanced - Optional]
  9. 视频: Bloom Filters: The Basics
  10. 视频: Bloom Filters: Heuristic Analysis
  11. Reading: Optional Theory Problems (Week 4)
  12. Reading: Info and FAQ for final exam
已评分: Problem Set #4
已评分: Programming Assignment #4
已评分: Final Exam

常见问题解答
运作方式
Coursework
Coursework

Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.

Help from Your Peers
Help from Your Peers

Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.

Certificates
Certificates

Earn official recognition for your work, and share your success with friends, colleagues, and employers.

制作方
斯坦福大学
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.8,总共 5 个 650 评分
NoneLand

This course is very good! The professor explain the algorithms in detail , and the programming assignment is challenging!Highly recommend!

FC

Amazing course! Tim Roughgarden is an exceptional teacher! I'm really enjoying reviewing this algorithms and data structures topics

Piyush Singh

I think this was the best course of the specialization. Stacks, queues, heaps, search trees, hash tables etc. are data structures everyone should know; when to use and their raison d'etre as he says.. and to that end this course is very effective. This course also has a very nice flow. And of course, Prof. Tim Roughgarden is simply awesome. I wish I got a chance to be in his offline classroom.

CS

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.



您可能也喜欢
斯坦福大学
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
1 门课程
斯坦福大学
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
查看课程
斯坦福大学
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
1 门课程
斯坦福大学
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
查看课程
University of California, San Diego, National Research University Higher School of Economics
Algorithms on Strings
1 门课程
University of California, San Diego, National Research University Higher School of Economics
Algorithms on Strings
查看课程
University of California, San Diego, National Research University Higher School of Economics
Algorithms on Graphs
1 门课程
University of California, San Diego, National Research University Higher School of Economics
Algorithms on Graphs
查看课程
University of California, San Diego, National Research University Higher School of Economics
Advanced Algorithms and Complexity
1 门课程
University of California, San Diego, National Research University Higher School of Economics
Advanced Algorithms and Complexity
查看课程
Coursera
Coursera 致力于普及全世界最好的教育,它与全球一流大学和机构合作提供在线课程。
© 2018 Coursera Inc. 保留所有权利。
通过 App Store 下载通过 Google Play 获取
  • Coursera
  • 关于
  • 管理团队
  • 工作机会
  • 目录
  • 证书
  • 学位
  • 商务
  • 政府版
  • 社区
  • 合作伙伴
  • 社区助教
  • 专业译员
  • 开发者
  • Beta 测试人员
  • 连接
  • 博客
  • Facebook
  • 领英
  • Twitter
  • Google+
  • 技术博客
  • 更多
  • 条款
  • 隐私
  • 帮助
  • 内容访问
  • 媒体
  • 联系我们
  • 目录
  • 附属公司