AlgorithmsDynamic ProgrammingGreedy AlgorithmDivide And Conquer AlgorithmsRandomized AlgorithmSorting AlgorithmGraphsData StructureHash TableSpanning TreeNp-Completeness
算法 專項課程
Learn To Think Like A Computer Scientist. Master the fundamentals of the design and analysis of algorithms.
提供方
算法 專項課程斯坦福大学您將獲得的技能
關於此 專項課程
120,252 次近期查看
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.
應用的學習項目
Learners will practice and master the fundamentals of algorithms through several types of assessments. Every week, there is a multiple choice quiz to test your understanding of the most important concepts. There are also weekly programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. Each course concludes with a multiple-choice final exam.
學生職業成果
62%
完成此 專項課程 後開始了新的職業。
26%
加薪或升職。
可分享的證書
完成後獲得證書
100% 在線課程
立即開始，按照自己的計劃學習。
靈活的計劃
設置並保持靈活的截止日期。
中級
需要一些相關領域經驗。需要一些相關經驗。
完成時間大約為4 個月
建議 4 小時/週
英語（English）
字幕：英語（English）, 法語（French）, 巴西葡萄牙語, 俄語（Russian）, 西班牙語（Spanish）
學生職業成果
62%
完成此 專項課程 後開始了新的職業。
26%
加薪或升職。
可分享的證書
完成後獲得證書
100% 在線課程
立即開始，按照自己的計劃學習。
靈活的計劃
設置並保持靈活的截止日期。
中級
需要一些相關領域經驗。需要一些相關經驗。
完成時間大約為4 個月
建議 4 小時/週
英語（English）
字幕：英語（English）, 法語（French）, 巴西葡萄牙語, 俄語（Russian）, 西班牙語（Spanish）
此專項課程包含 4 門課程
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
4,158 個評分
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
1,690 個評分
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
1,056 個評分
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
677 個評分
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).
提供方
斯坦福大学
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.
常見問題
完成专项课程后我会获得大学学分吗？
此专项课程不提供大学学分，但部分大学可能会选择接受专项课程证书作为学分。查看您的合作院校，了解详情。Coursera 上的在线学位和 Mastertrack™ 证书提供获得大学学分的机会。
Can I just enroll in a single course?
如果订阅，您可以获得 7 天免费试听，在此期间，您可以取消课程，无需支付任何罚金。在此之后，我们不会退款，但您可以随时取消订阅。请阅读我们完整的退款政策。
我可以只注册一门课程吗？
可以！点击您感兴趣的课程卡开始注册即可。注册并完成课程后，您可以获得可共享的证书，或者您也可以旁听该课程免费查看课程资料。如果您订阅的课程是某专项课程的一部分，系统会自动为您订阅完整的专项课程。访问您的学生面板，跟踪您的进度。
Can I take the course for free?
是的，Coursera 可以为无法承担费用的学生提供助学金。通过点击左侧“注册”按钮下的“助学金”链接可以申请助学金。您可以根据屏幕提示完成申请，申请获批后会收到通知。您需要针对专项课程中的每一门课程完成上述步骤，包括毕业项目。了解更多。
我可以免费学习课程吗？
完成注册课程后，您可以学习专项课程中的所有课程，并且完成作业后可以获得证书。如果您只想阅读和查看课程内容，可以免费旁听该课程。如果您无法承担课程费用，可以申请助学金。
此课程是 100% 在线学习吗？是否需要现场参加课程？
此课程完全在线学习，无需到教室现场上课。您可以通过网络或移动设备随时随地访问课程视频、阅读材料和作业。
完成专项课程需要多长时间？
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.
Will I earn university credit for completing the Specialization?
No.
完成专项课程后我会获得大学学分吗？
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.
還有其他問題嗎？請訪問 學生幫助中心。
