关于此 专项课程
100% 在线课程

100% 在线课程

立即开始,按照自己的计划学习。
灵活的计划

灵活的计划

设置并保持灵活的截止日期。
中级

中级

完成时间(小时)

完成时间大约为4 个月

建议 7 小时/周
可选语言

英语(English)

字幕:英语(English)...

您将获得的技能

AlgorithmsDynamic ProgrammingGreedy AlgorithmDivide And Conquer Algorithms
100% 在线课程

100% 在线课程

立即开始,按照自己的计划学习。
灵活的计划

灵活的计划

设置并保持灵活的截止日期。
中级

中级

完成时间(小时)

完成时间大约为4 个月

建议 7 小时/周
可选语言

英语(English)

字幕:英语(English)...

专项课程 的运作方式

加入课程

Coursera 专项课程是帮助您掌握一门技能的一系列课程。若要开始学习,请直接注册专项课程,或预览专项课程并选择您要首先开始学习的课程。当您订阅专项课程的部分课程时,您将自动订阅整个专项课程。您可以只完成一门课程,您可以随时暂停学习或结束订阅。访问您的学生面板,跟踪您的课程注册情况和进度。

实践项目

每个专项课程都包括实践项目。您需要成功完成这个(些)项目才能完成专项课程并获得证书。如果专项课程中包括单独的实践项目课程,则需要在开始之前完成其他所有课程。

获得证书

在结束每门课程并完成实践项目之后,您会获得一个证书,您可以向您的潜在雇主展示该证书并在您的职业社交网络中分享。

how it works

此专项课程包含 4 门课程

课程1

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

4.8
2,154 个评分
416 个审阅
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
942 个评分
113 个审阅
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
593 个评分
69 个审阅
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
362 个评分
44 个审阅
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.

还有其他问题吗?请访问 学生帮助中心