关于此课程： 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.
制作方： Stanford University
教学方： Tim Roughgarden, Professor
Computer Science
| 基本信息 | 课程 2（共 4 门，Algorithms Specialization ） |
| 级别 | 中级 |
| 承诺学习时间 | 4 weeks of study, 4-8 hours/week |
| 语言 | English |
| 如何通过 | 通过所有计分作业以完成课程。 |
| 用户评分 |
授课大纲
第 1 周
Week 1
Breadth-first and depth-first search; computing strong components; applications.
9 个视频, 4 个阅读材料
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- 视频: Breadth-First Search (BFS): The Basics
- 视频: BFS and Shortest Paths
- 视频: BFS and Undirected Connectivity
- 视频: Depth-First Search (DFS): The Basics
- 视频: Topological Sort
- 视频: Computing Strong Components: The Algorithm
- 视频: Computing Strong Components: The Analysis
- 视频: Structure of the Web [Optional]
- Reading: Optional Theory Problems (Week 1)
已评分: Problem Set #1
已评分: Programming Assignment #1
第 2 周
Week 2
Dijkstra's shortest-path algorithm.
4 个视频, 2 个阅读材料
- Reading: Week 2 Overview
- 视频: Dijkstra's Algorithm: Examples
- 视频: Correctness of Dijkstra's Algorithm
- 视频: Dijkstra's Algorithm: Implementation and Running Time
- Reading: Optional Theory Problems (Week 2)
已评分: Problem Set #2
已评分: Programming Assignment #2
第 3 周
Week 3
Heaps; balanced binary search trees.
9 个视频, 1 个阅读材料
- Reading: Week 3 Overview
- 视频: Heaps: Operations and Applications
- 视频: Heaps: Implementation Details [Advanced - Optional]
- 视频: Balanced Search Trees: Operations and Applications
- 视频: Binary Search Tree Basics, Part I
- 视频: Binary Search Tree Basics, Part II
- 视频: Red-Black Trees
- 视频: Rotations [Advanced - Optional]
- 视频: Insertion in a Red-Black Tree [Advanced]
已评分: Problem Set #3
已评分: Programming Assignment #3
第 4 周
Week 4
Hashing; bloom filters.
9 个视频, 3 个阅读材料
- Reading: Week 4 Overview
- 视频: Hash Tables: Implementation Details, Part I
- 视频: Hash Tables: Implementation Details, Part II
- 视频: Pathological Data Sets and Universal Hashing Motivation
- 视频: Universal Hashing: Definition and Example [Advanced - Optional]
- 视频: Universal Hashing: Analysis of Chaining [Advanced - Optional]
- 视频: Hash Table Performance with Open Addressing [Advanced - Optional]
- 视频: Bloom Filters: The Basics
- 视频: Bloom Filters: Heuristic Analysis
- Reading: Optional Theory Problems (Week 4)
- Reading: Info and FAQ for final exam
已评分: Problem Set #4
已评分: Programming Assignment #4
已评分: Final Exam
常见问题解答
运作方式
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
制作方
Stanford University
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.
价格
| 购买课程 | |
|---|---|
| 访问课程材料 | 可用 |
| 访问评分的材料 | 可用 |
| 收到最终成绩 | 可用 |
| 获得可共享的课程证书 | 可用 |
评分和审阅
Excellent course!
Provided great insight into algorithms
This is an excellent course! It is well explained and I would recommend it to anyone interested in algorithms and data structures covered in this course.
JB
This course was much harder than the first one. Plan to spend extra time doing the assignments. However, it is totally worth it!