
link
来源:www.coursera.org
list
4个序列
assignment
等级:中级
label
算法和数据结构
chat_bubble_outline
语言:英语
card_giftcard
160分
评论
关键信息
credit_card
免费进入
verified_user
收费证书
timer
16小时总数
关于内容
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).
more_horiz
查看更多
more_horiz
收起
dns
课程大纲
- Week 1 - Week 1
Breadth-first and depth-first search; computing strong components; applications. - Week 2 - Week 2
Dijkstra's shortest-path algorithm. - Week 3 - Week 3
Heaps; balanced binary search trees. - Week 4 - Week 4
Hashing; bloom filters.
record_voice_over
教师
Tim Roughgarden
Professor
Computer Science
store
内容设计师

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是一家数字公司,提供由位于加利福尼亚州山景城的计算机教师Andrew Ng和达芙妮科勒斯坦福大学创建的大型开放式在线课程。
Coursera与顶尖大学和组织合作,在线提供一些课程,并提供许多科目的课程,包括:物理,工程,人文,医学,生物学,社会科学,数学,商业,计算机科学,数字营销,数据科学 和其他科目。
您是 MOOC 的设计者?
keyboard_arrow_left
grade
keyboard_arrow_right
整合评论系统