課程信息

41,401 次近期查看

學生職業成果

62%

完成這些課程後已開始新的職業生涯

50%

通過此課程獲得實實在在的工作福利

12%

加薪或升職
可分享的證書
完成後獲得證書
100% 在線
立即開始,按照自己的計劃學習。
第 4 門課程(共 4 門)
可靈活調整截止日期
根據您的日程表重置截止日期。
中級
完成時間大約為11 小時
英語(English)
字幕:英語(English)

您將獲得的技能

Data StructureAlgorithmsNp-CompletenessDynamic Programming

學生職業成果

62%

完成這些課程後已開始新的職業生涯

50%

通過此課程獲得實實在在的工作福利

12%

加薪或升職
可分享的證書
完成後獲得證書
100% 在線
立即開始,按照自己的計劃學習。
第 4 門課程(共 4 門)
可靈活調整截止日期
根據您的日程表重置截止日期。
中級
完成時間大約為11 小時
英語(English)
字幕:英語(English)

講師

提供方

斯坦福大学 徽標

斯坦福大学

教學大綱 - 您將從這門課程中學到什麼

1

1

完成時間為 3 小時

Week 1

完成時間為 3 小時
14 個視頻 (總計 151 分鐘), 4 個閱讀材料, 2 個測驗
14 個視頻
Optimal Substructure10分鐘
The Basic Algorithm I8分鐘
The Basic Algorithm II10分鐘
Detecting Negative Cycles9分鐘
A Space Optimization12分鐘
Internet Routing I [Optional]11分鐘
Internet Routing II [Optional]6分鐘
Problem Definition7分鐘
Optimal Substructure12分鐘
The Floyd-Warshall Algorithm13分鐘
A Reweighting Technique14分鐘
Johnson's Algorithm I11分鐘
Johnson's Algorithm II11分鐘
4 個閱讀材料
Week 1 Overview10分鐘
Overview, Resources, and Policies10分鐘
Lecture Slides10分鐘
Optional Theory Problems (Week 1)10分鐘
2 個練習
Problem Set #110分鐘
Programming Assignment #12分鐘
2

2

完成時間為 3 小時

Week 2

完成時間為 3 小時
11 個視頻 (總計 122 分鐘), 2 個閱讀材料, 2 個測驗
11 個視頻
Reductions and Completeness13分鐘
Definition and Interpretation of NP-Completeness I10分鐘
Definition and Interpretation of NP-Completeness II7分鐘
The P vs. NP Question9分鐘
Algorithmic Approaches to NP-Complete Problems12分鐘
The Vertex Cover Problem8分鐘
Smarter Search for Vertex Cover I9分鐘
Smarter Search for Vertex Cover II7分鐘
The Traveling Salesman Problem14分鐘
A Dynamic Programming Algorithm for TSP12分鐘
2 個閱讀材料
Week 2 Overview10分鐘
Optional Theory Problems (Week 2)10分鐘
2 個練習
Problem Set #210分鐘
Programming Assignment #22分鐘
3

3

完成時間為 2 小時

Week 3

完成時間為 2 小時
6 個視頻 (總計 68 分鐘), 1 個閱讀材料, 2 個測驗
6 個視頻
Analysis of a Greedy Knapsack Heuristic I7分鐘
Analysis of a Greedy Knapsack Heuristic II9分鐘
A Dynamic Programming Heuristic for Knapsack11分鐘
Knapsack via Dynamic Programming, Revisited10分鐘
Ananysis of Dynamic Programming Heuristic15分鐘
1 個閱讀材料
Week 3 Overview10分鐘
2 個練習
Problem Set #310分鐘
Programming Assignment #32分鐘
4

4

完成時間為 3 小時

Week 4

完成時間為 3 小時
11 個視頻 (總計 124 分鐘), 3 個閱讀材料, 3 個測驗
11 個視頻
The Maximum Cut Problem II9分鐘
Principles of Local Search I8分鐘
Principles of Local Search II10分鐘
The 2-SAT Problem14分鐘
Random Walks on a Line16分鐘
Analysis of Papadimitriou's Algorithm14分鐘
Stable Matching [Optional]15分鐘
Matchings, Flows, and Braess's Paradox [Optional]13分鐘
Linear Programming and Beyond [Optional]11分鐘
Epilogue1分鐘
3 個閱讀材料
Week 4 Overview10分鐘
Optional Theory Problems (Week 4)10分鐘
Info and FAQ for final exam10分鐘
3 個練習
Problem Set #410分鐘
Programming Assignment #42分鐘
Final Exam20分鐘

審閱

來自SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM的熱門評論

查看所有評論

關於 算法 專項課程

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....
算法

常見問題

  • Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:

    • The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.

    • The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

  • If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.

  • Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project. Learn more.

還有其他問題嗎?請訪問 學生幫助中心