課程信息
4.8
2,589 個評分
482 個審閱

第 1 門課程(共 4 門)

100% 在線

立即開始,按照自己的計劃學習。

可靈活調整截止日期

根據您的日程表重置截止日期。

中級

完成時間大約為21 小時

建議:4 weeks of study, 4-8 hours/week...

英語(English)

字幕:英語(English)

您將獲得的技能

AlgorithmsRandomized AlgorithmSorting AlgorithmDivide And Conquer Algorithms

第 1 門課程(共 4 門)

100% 在線

立即開始,按照自己的計劃學習。

可靈活調整截止日期

根據您的日程表重置截止日期。

中級

完成時間大約為21 小時

建議:4 weeks of study, 4-8 hours/week...

英語(English)

字幕:英語(English)

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

1
完成時間為 3 小時

Week 1

Introduction; "big-oh" notation and asymptotic analysis....
13 個視頻 (總計 130 分鐘), 3 個閱讀材料, 2 個測驗
13 個視頻
Integer Multiplication8分鐘
Karatsuba Multiplication12分鐘
About the Course17分鐘
Merge Sort: Motivation and Example8分鐘
Merge Sort: Pseudocode12分鐘
Merge Sort: Analysis9分鐘
Guiding Principles for Analysis of Algorithms15分鐘
The Gist14分鐘
Big-Oh Notation4分鐘
Basic Examples7分鐘
Big Omega and Theta7分鐘
Additional Examples [Review - Optional]7分鐘
3 個閱讀材料
Welcome and Week 1 Overview10分鐘
Overview, Resources, and Policies10分鐘
Lecture slides10分鐘
2 個練習
Problem Set #110分鐘
Programming Assignment #12分鐘
2
完成時間為 3 小時

Week 2

Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms....
11 個視頻 (總計 170 分鐘), 2 個閱讀材料, 2 個測驗
11 個視頻
O(n log n) Algorithm for Counting Inversions II16分鐘
Strassen's Subcubic Matrix Multiplication Algorithm22分鐘
O(n log n) Algorithm for Closest Pair I [Advanced - Optional]31分鐘
O(n log n) Algorithm for Closest Pair II [Advanced - Optional]18分鐘
Motivation7分鐘
Formal Statement10分鐘
Examples13分鐘
Proof I9分鐘
Interpretation of the 3 Cases10分鐘
Proof II16分鐘
2 個閱讀材料
Week 2 Overview10分鐘
Optional Theory Problems (Batch #1)10分鐘
2 個練習
Problem Set #210分鐘
Programming Assignment #22分鐘
3
完成時間為 3 小時

Week 3

The QuickSort algorithm and its analysis; probability review....
9 個視頻 (總計 156 分鐘), 1 個閱讀材料, 2 個測驗
9 個視頻
Partitioning Around a Pivot24分鐘
Correctness of Quicksort [Review - Optional]10分鐘
Choosing a Good Pivot22分鐘
Analysis I: A Decomposition Principle21分鐘
Analysis II: The Key Insight11分鐘
Analysis III: Final Calculations8分鐘
Probability Review I25分鐘
Probability Review II17分鐘
1 個閱讀材料
Week 3 Overview10分鐘
2 個練習
Problem Set #310分鐘
Programming Assignment #36分鐘
4
完成時間為 4 小時

Week 4

Linear-time selection; graphs, cuts, and the contraction algorithm....
11 個視頻 (總計 184 分鐘), 3 個閱讀材料, 3 個測驗
11 個視頻
Randomized Selection - Analysis20分鐘
Deterministic Selection - Algorithm [Advanced - Optional]16分鐘
Deterministic Selection - Analysis I [Advanced - Optional]22分鐘
Deterministic Selection - Analysis II [Advanced - Optional]12分鐘
Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]13分鐘
Graphs and Minimum Cuts15分鐘
Graph Representations14分鐘
Random Contraction Algorithm8分鐘
Analysis of Contraction Algorithm30分鐘
Counting Minimum Cuts7分鐘
3 個閱讀材料
Week 4 Overview10分鐘
Optional Theory Problems (Batch #2)10分鐘
Info and FAQ for final exam10分鐘
3 個練習
Problem Set #410分鐘
Programming Assignment #42分鐘
Final Exam20分鐘
4.8
482 個審閱Chevron Right

33%

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

34%

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

26%

加薪或升職

熱門審閱

創建者 KSSep 14th 2018

Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.

創建者 CVJun 11th 2017

A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.

講師

Avatar

Tim Roughgarden

Professor
Computer Science

關於 斯坦福大学

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

常見問題

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

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

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