About this 專項課程
100% 在線課程

100% 在線課程

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

靈活的計劃

設置並保持靈活的截止日期。
中級

中級

完成時間(小時)

完成時間大約為4 個月

建議 7 小時/週
可選語言

英語(English)

字幕:英語(English)...

您將獲得的技能

AlgorithmsDynamic ProgrammingGreedy AlgorithmDivide And Conquer Algorithms
100% 在線課程

100% 在線課程

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

靈活的計劃

設置並保持靈活的截止日期。
中級

中級

完成時間(小時)

完成時間大約為4 個月

建議 7 小時/週
可選語言

英語(English)

字幕:英語(English)...

How the 專項課程 Works

加入課程

Coursera 專項課程是幫助您掌握一門技能的一系列課程。若要開始學習,請直接註冊專項課程,或預覽專項課程並選擇您要首先開始學習的課程。當您訂閱專項課程的部分課程時,您將自動訂閱整個專項課程。您可以只完成一門課程,您可以隨時暫停學習或結束訂閱。訪問您的學生面板,跟踪您的課程註冊情況和進度。

實踐項目

每個專項課程都包括實踐項目。您需要成功完成這個(些)項目才能完成專項課程並獲得證書。如果專項課程中包括單獨的實踐項目課程,則需要在開始之前完成其他所有課程。

獲得證書

在結束每門課程並完成實踐項目之後,您會獲得一個證書,您可以向您的潛在雇主展示該證書並在您的職業社交網絡中分享。

how it works

此專項課程包含 4 門課程

課程1

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

4.8
2,089 個評分
405 個審閱
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)....
課程2

Graph Search, Shortest Paths, and Data Structures

4.8
916 個評分
109 個審閱
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)....
課程3

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

4.8
580 個評分
66 個審閱
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)....
課程4

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

4.8
355 個評分
42 個審閱
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)....

講師

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

常見問題

  • 可以!点击您感兴趣的课程卡开始注册即可。注册并完成课程后,您可以获得可共享的证书,或者您也可以旁听该课程免费查看课程资料。如果您订阅的课程是某专项课程的一部分,系统会自动为您订阅完整的专项课程。访问您的学生面板,跟踪您的进度。

  • 此课程完全在线学习,无需到教室现场上课。您可以通过网络或移动设备随时随地访问课程视频、阅读材料和作业。

  • 此专项课程不提供大学学分,但部分大学可能会选择接受专项课程证书作为学分。查看您的合作院校了解详情。

  • The Specialization has four four-week courses, for a total of sixteen weeks.

  • 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.

  • For best results, the courses should be taken in order.

  • 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.

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