贪婪算法、最小生成树和动态规划

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

1287 次查看
斯坦福大学
Coursera
  • 完成时间大约为 22 个小时
  • 普通(中级)
  • 英语
注:本课程由Coursera和Linkshare共同提供,因开课平台的各种因素变化,以上开课日期仅供参考

课程概况

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

课程大纲

Week 1

Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

Week 2

Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).

Week 3

Huffman codes; introduction to dynamic programming.

Week 4

Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Programming Category (English)728x90
声明: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 MOOC.CN 慕课改变你,你改变世界