江苏快三开奖结果

算法專項課程

Algorithms

NIJIANGXUEDAOSUANFASHEJIDEDUOZHONGJIBENYUANLI:FENZHIFA、TUSUANFA、SHIYONGSHUJUJIEGOU(DUI、HAXIBIAO、SOUSUOSHU)、SUIJIHUASUANFADENG。

斯坦福大學

Coursera

計算機

普通(中級)

4 個月

算法設計與分析
本課程由Coursera和Linkshare共同提供
  • 英語
  • 2980

課程概況

江苏快三开奖结果ZHEMENKEZHONG,NIJIANGXUEDAOSUANFASHEJIDEDUOZHONGJIBENYUANLI。NIJIANGXUEDAOFENZHIFASHEJIFANSHI,LEJIETAZAIKUAISUPAIXU、SOUSUOJICHENGFAZHONGDEYINGYONG。NIJIANGXUEDAODUOZHONGZAITUSHANGJIKUAISUJINXINGJISUANDEJIBENFANGFA,LIRUJISUANLIANTONGXINGXINXIHEZUIDUANLUJING。ZUIHOU,WOMENJIANGXUEXI,RANGDIANNAO“PAOYINGBI”RUHEYINCHUYOUYAERSHIYONGDESUANFAHESHUJUJIEGOU。WOMENYAOTANTAODEWENTIBAOKUO:DUI、HAXIBIAO、BULONGGUOLVQIHEPINGHENGSOUSUOSHUZHEYANGDESHUJUJIEGOUSHIRUHEGONGZUODE?WEISHENMEKUAISUPAIXUNENGYUNXINGDEZHEMEKUAI?GUANYUWANGLUOJIEGOUHESHEJIAOWANGLUO,TUSUANFANENGGAOSUWOMENYIXIESHENMEZHISHI?SANNIANJILAOSHISUOJIAODECHENGFASUANFAZHISHICIYOUSUANFAMA?

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.

你將學到什么

Algorithms

江苏快三开奖结果Dynamic Programming

Greedy Algorithm

Divide And Conquer Algorithms

包含課程

課程1
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).

課程2
江苏快三开奖结果 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 de...

課程3
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).

課程4
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).

預備知識

ZHISHAOZHIDAORUHESHIYONGYIZHONGYUYANJINXINGBIANCHENG(RUCYUYAN、JavaHUOPython);SHUXIZHENGMINGFANGFA,BAOKUOGUINAFAHEFANZHENGFAZHENGMING。 ZAISITANFUDAXUE,ZHEMENKEDELINGYIBANBENBEITIGONGGEIJISUANJIKEXUEZHUANYEDAER、DASAN、DASISHUIPINGDETONGXUEXUEXI。

聲明:MOOC中國十分重視知識產權問題,我們發布之課程均源自下列機構,版權均歸其所有,本站僅作報道收錄并尊重其著作權益。感謝他們對MOOC事業做出的貢獻!
  • Coursera
  • edX
  • OpenLearning
  • FutureLearn
  • iversity
  • Udacity
  • NovoEd
  • Canvas
  • Open2Study
  • Google
  • ewant
  • FUN
  • IOC-Athlete-MOOC
  • World-Science-U
  • Codecademy
  • CourseSites
  • opencourseworld
  • ShareCourse
  • gacco
  • MiriadaX
  • JANUX
  • openhpi
  • Stanford-Open-Edx
  • 網易云課堂
  • 中國大學MOOC
  • 學堂在線
  • 頂你學堂
  • 華文慕課
  • 好大學在線CnMooc
  • (部分課程由Coursera、Udemy、Linkshare共同提供)

© 2008-2019 zh-only.com 慕課改變你,你改變世界