0 |
wzyer 2013-05-22 15:34 0 票支持; 0 票反对
课程题目叫“算法”显得有些大了。这个课程主要侧重图算法,不过图算法的覆盖面也不大,主要还是基础。作为学习的补充还是不错的,想从这里系统的入门就不要指望了。 |
开始时间: 04/22/2022 持续时间: 自主
所在平台: Udacity 课程类别: 计算机科学 大学或机构: Udacity Self |
课程主页: https://www.udacity.com/course/cs215
课程评论: 1 个评论
By the end of this class you will understand key concepts needed to devise new algorithms for graphs and other important data structures and to evaluate the efficiency of these algorithms.
Lesson 1: A Social Network Magic Trick
Becoming familiar with algorithm analysis
Lesson 2: Growth Rates in Social Networks
Using mathematical tools to analyze how things are connected
Lesson 3: Basic Graph Algorithms
Finding the quickest route to Kevin Bacon
Lesson 4: It’s Who You Know
Keeping track of your best friends using heaps
Lesson 5: Strong and Weak Bonds
Working with social networks with edge weights.
Lesson 6: Hardness of Network Problems
Exploring what it means for a social network problem to be harder than other.
Lesson 7: Conclusion
0 |
wzyer 2013-05-22 15:34 0 票支持; 0 票反对
课程题目叫“算法”显得有些大了。这个课程主要侧重图算法,不过图算法的覆盖面也不大,主要还是基础。作为学习的补充还是不错的,想从这里系统的入门就不要指望了。 |
Ever played the Kevin Bacon game? This class will show you how it works by giving you an introduction to the design and analysis of algorithms, enabling you to discover how individuals are connected.
Artificial Intelligence for Robotics 关注
Differential Equations in Action 关注
Introduction to Theoretical Computer Science 关注
Functional Hardware Verification 关注