课程信息
4.8
591 个评分
68 个审阅
专项课程

Course 3 of 4 in the

100% 在线

100% 在线

立即开始,按照自己的计划学习。
可灵活调整截止日期

可灵活调整截止日期

根据您的日程表重置截止日期。
中级

中级

完成时间(小时)

完成时间大约为21 小时

建议:4 weeks of study, 4-8 hours/week...
可选语言

英语(English)

字幕:英语(English)

您将获得的技能

Spanning TreeAlgorithmsDynamic ProgrammingGreedy Algorithm
专项课程

Course 3 of 4 in the

100% 在线

100% 在线

立即开始,按照自己的计划学习。
可灵活调整截止日期

可灵活调整截止日期

根据您的日程表重置截止日期。
中级

中级

完成时间(小时)

完成时间大约为21 小时

建议:4 weeks of study, 4-8 hours/week...
可选语言

英语(English)

字幕:英语(English)

教学大纲 - 您将从这门课程中学到什么

1
完成时间(小时)
完成时间为 4 小时

Week 1

Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm....
Reading
16 个视频 (总计 160 分钟), 4 个阅读材料, 2 个测验
Video16 个视频
Application: Sequence Alignment8分钟
Introduction to Greedy Algorithms12分钟
Application: Optimal Caching10分钟
Problem Definition5分钟
A Greedy Algorithm12分钟
Correctness Proof - Part I6分钟
Correctness Proof - Part II4分钟
Handling Ties [Advanced - Optional]7分钟
MST Problem Definition11分钟
Prim's MST Algorithm7分钟
Correctness Proof I15分钟
Correctness Proof II8分钟
Proof of Cut Property [Advanced - Optional]11分钟
Fast Implementation I14分钟
Fast Implementation II9分钟
Reading4 个阅读材料
Week 1 Overview10分钟
Overview, Resources, and Policies10分钟
Lecture slides10分钟
Optional Theory Problems (Week 1)10分钟
Quiz2 个练习
Problem Set #110分钟
Programming Assignment #16分钟
2
完成时间(小时)
完成时间为 4 小时

Week 2

Kruskal's MST algorithm and applications to clustering; advanced union-find (optional). ...
Reading
16 个视频 (总计 188 分钟), 2 个阅读材料, 2 个测验
Video16 个视频
Correctness of Kruskal's Algorithm9分钟
Implementing Kruskal's Algorithm via Union-Find I9分钟
Implementing Kruskal's Algorithm via Union-Find II13分钟
MSTs: State-of-the-Art and Open Questions [Advanced - Optional]9分钟
Application to Clustering11分钟
Correctness of Clustering Algorithm9分钟
Lazy Unions [Advanced - Optional]10分钟
Union-by-Rank [Advanced - Optional]12分钟
Analysis of Union-by-Rank [Advanced - Optional]14分钟
Path Compression [Advanced - Optional]14分钟
Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]9分钟
Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]11分钟
The Ackermann Function [Advanced - Optional]16分钟
Path Compression: Tarjan's Analysis I [Advanced - Optional]14分钟
Path Compression: Tarjan's Analysis II [Advanced - Optional]13分钟
Reading2 个阅读材料
Week 2 Overview10分钟
Optional Theory Problems (Week 2)10分钟
Quiz2 个练习
Problem Set #210分钟
Programming Assignment #24分钟
3
完成时间(小时)
完成时间为 2 小时

Week 3

Huffman codes; introduction to dynamic programming....
Reading
11 个视频 (总计 105 分钟), 1 个阅读材料, 2 个测验
Video11 个视频
Problem Definition10分钟
A Greedy Algorithm16分钟
A More Complex Example4分钟
Correctness Proof I10分钟
Correctness Proof II12分钟
Introduction: Weighted Independent Sets in Path Graphs7分钟
WIS in Path Graphs: Optimal Substructure9分钟
WIS in Path Graphs: A Linear-Time Algorithm9分钟
WIS in Path Graphs: A Reconstruction Algorithm6分钟
Principles of Dynamic Programming7分钟
Reading1 个阅读材料
Week 3 Overview10分钟
Quiz2 个练习
Problem Set #310分钟
Programming Assignment #36分钟
4
完成时间(小时)
完成时间为 3 小时

Week 4

Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees....
Reading
10 个视频 (总计 107 分钟), 3 个阅读材料, 3 个测验
Video10 个视频
A Dynamic Programming Algorithm9分钟
Example [Review - Optional]12分钟
Optimal Substructure13分钟
A Dynamic Programming Algorithm12分钟
Problem Definition12分钟
Optimal Substructure9分钟
Proof of Optimal Substructure6分钟
A Dynamic Programming Algorithm I9分钟
A Dynamic Programming Algorithm II9分钟
Reading3 个阅读材料
Week 4 Overview10分钟
Optional Theory Problems (Week 4)10分钟
Info and FAQ for final exam10分钟
Quiz3 个练习
Problem Set #410分钟
Programming Assignment #44分钟
Final Exam20分钟
4.8
68 个审阅Chevron Right
职业方向

67%

完成这些课程后已开始新的职业生涯
工作福利

83%

通过此课程获得实实在在的工作福利

热门审阅

创建者 JPOct 20th 2018

Great learning experience!!!\n\nI love dynamic p the most.\n\nAssignment 4 is so challenging that it takes me a week to finish the program and debug it!!!

创建者 AJFeb 9th 2017

I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!

讲师

Avatar

Tim Roughgarden

Professor
Computer Science

关于 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....

关于 Algorithms 专项课程

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. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications....
Algorithms

常见问题

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您注册课程后,将有权访问专项课程中的所有课程,并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

还有其他问题吗?请访问 学生帮助中心