關於此課程：The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
此課程適用人群：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
| 基本信息 | 課程 3（共 4 門，Algorithms Specialization ） |
| 級別 | 中級 |
| 承諾學習時間 | 4 weeks of study, 4-8 hours/week |
| 語言 | English |
| 如何通過 | 通過所有計分作業以完成課程。 |
| 用戶評分 |
授課大綱
第 1 週
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
16 個視頻, 4 個閱讀材料
- Reading: Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- 視頻: Application: Sequence Alignment
- 視頻: Introduction to Greedy Algorithms
- 視頻: Application: Optimal Caching
- 視頻: Problem Definition
- 視頻: A Greedy Algorithm
- 視頻: Correctness Proof - Part I
- 視頻: Correctness Proof - Part II
- 視頻: Handling Ties [Advanced - Optional]
- 視頻: MST Problem Definition
- 視頻: Prim's MST Algorithm
- 視頻: Correctness Proof I
- 視頻: Correctness Proof II
- 視頻: Proof of Cut Property [Advanced - Optional]
- 視頻: Fast Implementation I
- 視頻: Fast Implementation II
- Reading: Optional Theory Problems (Week 1)
已評分: Problem Set #1
已評分: Programming Assignment #1
第 2 週
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
16 個視頻, 2 個閱讀材料
- Reading: Week 2 Overview
- 視頻: Correctness of Kruskal's Algorithm
- 視頻: Implementing Kruskal's Algorithm via Union-Find I
- 視頻: Implementing Kruskal's Algorithm via Union-Find II
- 視頻: MSTs: State-of-the-Art and Open Questions [Advanced - Optional]
- 視頻: Application to Clustering
- 視頻: Correctness of Clustering Algorithm
- 視頻: Lazy Unions [Advanced - Optional]
- 視頻: Union-by-Rank [Advanced - Optional]
- 視頻: Analysis of Union-by-Rank [Advanced - Optional]
- 視頻: Path Compression [Advanced - Optional]
- 視頻: Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]
- 視頻: Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]
- 視頻: The Ackermann Function [Advanced - Optional]
- 視頻: Path Compression: Tarjan's Analysis I [Advanced - Optional]
- 視頻: Path Compression: Tarjan's Analysis II [Advanced - Optional]
- Reading: Optional Theory Problems (Week 2)
已評分: Problem Set #2
已評分: Programming Assignment #2
第 3 週
Week 3
Huffman codes; introduction to dynamic programming.
11 個視頻, 1 個閱讀材料
- Reading: Week 3 Overview
- 視頻: Problem Definition
- 視頻: A Greedy Algorithm
- 視頻: A More Complex Example
- 視頻: Correctness Proof I
- 視頻: Correctness Proof II
- 視頻: Introduction: Weighted Independent Sets in Path Graphs
- 視頻: WIS in Path Graphs: Optimal Substructure
- 視頻: WIS in Path Graphs: A Linear-Time Algorithm
- 視頻: WIS in Path Graphs: A Reconstruction Algorithm
- 視頻: Principles of Dynamic Programming
已評分: Problem Set #3
已評分: Programming Assignment #3
第 4 週
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
10 個視頻, 3 個閱讀材料
- Reading: Week 4 Overview
- 視頻: A Dynamic Programming Algorithm
- 視頻: Example [Review - Optional]
- 視頻: Optimal Substructure
- 視頻: A Dynamic Programming Algorithm
- 視頻: Problem Definition
- 視頻: Optimal Substructure
- 視頻: Proof of Optimal Substructure
- 視頻: A Dynamic Programming Algorithm I
- 視頻: A Dynamic Programming Algorithm II
- 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.
價格
| 購買課程 | |
|---|---|
| 訪問課程材料 | 可用 |
| 訪問評分的材料 | 可用 |
| 收到最終成績 | 可用 |
| 獲得可共享的課程證書 | 可用 |
評分和審閱
The most difficult course in the specialization so far. I learned a lot.
Difficult but enriching course! Really helpful to me :D
Excellent course, I found this course hard as compared to earlier two courses. Many of the Lectures needs to be viewed twice to understand to my minimum level of satisfaction. Quizzes make sure that you understand concepts well and programming assignments are excellent!
PS
Great material, explained very well, but the lack of feedback on tough problem sets can be frustrating;