Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
link 来源:www.coursera.org
list 4个序列
assignment 等级:中级
chat_bubble_outline 语言:英语
card_giftcard 160分
Logo My Mooc Business

他们选择Edflex来发展业务技能。

开始使用
评论
-
starstarstarstarstar
0条评论

关键信息

credit_card 免费进入
verified_user 收费证书
timer 16小时总数

关于内容

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

more_horiz 查看更多
more_horiz 收起
dns

课程大纲

  • Week 1 - Week 1
    Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
  • Week 2 - Week 2
    Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
  • Week 3 - Week 3
    Huffman codes; introduction to dynamic programming.
  • Week 4 - Week 4
    Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
record_voice_over

教师

Tim Roughgarden
Professor
Computer Science

store

内容设计师

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

平台

Coursera

Coursera是一家数字公司,提供由位于加利福尼亚州山景城的计算机教师Andrew Ng和达芙妮科勒斯坦福大学创建的大型开放式在线课程。

Coursera与顶尖大学和组织合作,在线提供一些课程,并提供许多科目的课程,包括:物理,工程,人文,医学,生物学,社会科学,数学,商业,计算机科学,数字营销,数据科学 和其他科目。

您是 MOOC 的设计者?
您对这门课的评价是?
内容
5/5
平台
5/5
动画
5/5