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.
- Machine Learning Engineers
- Software Engineers
- Data Scientists
- Data Engineers
- Tutors
您將獲得的技能
專項課程的運作方式
加入課程
Coursera 專項課程是幫助您掌握一門技能的一系列課程。若要開始學習，請直接註冊專項課程，或預覽專項課程並選擇您要首先開始學習的課程。當您訂閱專項課程的部分課程時，您將自動訂閱整個專項課程。您可以只完成一門課程，您可以隨時暫停學習或結束訂閱。訪問您的學生面板，跟踪您的課程註冊情況和進度。
實踐項目
每個專項課程都包括實踐項目。您需要成功完成這個（些）項目才能完成專項課程並獲得證書。如果專項課程中包括單獨的實踐項目課程，則需要在開始之前完成其他所有課程。
獲得證書
在結束每門課程並完成實踐項目之後，您會獲得一個證書，您可以向您的潛在雇主展示該證書並在您的職業社交網絡中分享。
此專項課程包含 4 門課程
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Graph Search, Shortest Paths, and Data Structures
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).
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
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).
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
講師
Tim Roughgarden
Professor關於 斯坦福大学
常見問題
退款政策是如何规定的？
我可以只注册一门课程吗？
可以！点击您感兴趣的课程卡开始注册即可。注册并完成课程后，您可以获得可共享的证书，或者您也可以旁听该课程免费查看课程资料。如果您订阅的课程是某专项课程的一部分，系统会自动为您订阅完整的专项课程。访问您的学生面板，跟踪您的进度。
有助学金吗？
我可以免费学习课程吗？
此课程是 100% 在线学习吗？是否需要现场参加课程？
此课程完全在线学习，无需到教室现场上课。您可以通过网络或移动设备随时随地访问课程视频、阅读材料和作业。
完成专项课程需要多长时间？
The Specialization has four four-week courses, for a total of sixteen weeks.
What background knowledge is necessary?
Learners should know how to program in at least one programming language (like C, Java, or Python); some familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.
Do I need to take the courses in a specific order?
For best results, the courses should be taken in order.
完成专项课程后我会获得大学学分吗？
No.
What will I be able to do upon completing the Specialization?
Having taken your programming and thinking skills to the next level, you will be well positioned to ace your technical interviews, pursue serious software engineering, and study advanced topics in algorithms.
還有其他問題嗎？請訪問 學生幫助中心。
