一亩三分地论坛

 找回密码
 获取更多干货,去instant注册!

扫码关注一亩三分地公众号
查看: 2428|回复: 14
收起左侧

Stanford University Algorithms: Design and Analysis, Part 1

[复制链接] |试试Instant~ |关注本帖
chmajor 发表于 2014-4-26 20:14:22 | 显示全部楼层 |阅读模式

[Coursera]Algorithms: Design and Analysis, Part 1 #6 - 2014-04-28@Stanford University

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看,没有帐号?获取更多干货,去instant注册!

x
About the CourseIn this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?
Course SyllabusWeek 1: Introduction.  Asymptotic analysis including big-oh notation.  Divide-and-conquer algorithms for sorting, counting inversions, matrix multiplication, and closest pair.

Week 2: Running time analysis of divide-and-conquer algorithms.  The master method.  Introduction to randomized algorithms, with a probability review.  QuickSort.

Week 3: More on randomized algorithms and probability.  Computing the median in linear time.  A randomized algorithm for the minimum graph cut problem.

Week 4: Graph primitives.  Depth- and breadth-first search.  Connected components in undirected graphs.  Topological sort in directed acyclic graphs.  Strongly connected components in directed graphs.

Week 5: Dijkstra's shortest-path algorithm.  Introduction to data structures.  Heaps and applications.

Week 6: Further data structures.  Hash tables and applications.  Balanced binary search trees.

Recommended BackgroundHow to program in at least one programming language (like C, Java, or Python); and familiarity with proofs, including proofs by induction and by contradiction.  At stanford, a version of this course is taken by SOPhomore, junior, and senior-level computer science majors.  




Suggested ReadingsNo specific textbook is required for the course.  Much of the course material is covered by the well-known textbooks on algorithms, and the student is encouraged to consult their favorite for additional information.

Course FormatThe class will consist of lecture videos, generally between 10 and 15 minutes in length. These usually integrated quiz questions. There will also be standalone homeworks and programming assignments that are not part of video lectures, and a final exam.



FAQ
  • Will I get a statement of accomplishment after completing this class?
    Yes. Students who successfully complete the class will receive a statement of accomplishment signed by the instructor.
  • What is the format of the class?
    The class consists of lecture videos, which are broken into small chunks, usually between eight and twelve minutes each. Some of these may contain integrated quiz questions. There will also be standalone quizzes that are not part of video lectures. There will be approximately two hours worth of video content per week.
  • What should I know to take this class?
    How to program in at least one programming language (like C, Java, or Python); familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.


  • How does Algorithms: Design and Analysis differ from the Princeton University algorithms course?
    The two courses are complementary. That one emphasizes implementation and testing; this one focuses on algorithm design paradigms and relevant mathematical models for analysis. In a typical computer science curriculum, a course like this one is taken by juniors and seniors, and a course like that one is taken by first- and second-year students.




sky420 发表于 2014-4-29 02:48:22 | 显示全部楼层
终于开始了!有没有人建群呀?
回复 支持 反对

使用道具 举报

 楼主| chmajor 发表于 2014-4-29 06:11:24 | 显示全部楼层
本帖最后由 chmajor 于 2014-4-29 09:21 编辑

我建一个QQ群:...刚发现mitbbs上已经有人建了群,大家就加入这个群,一起讨论
群号:230300083
回复 支持 反对

使用道具 举报

chloeme 发表于 2014-4-29 08:54:24 | 显示全部楼层
just signed it up!
回复 支持 反对

使用道具 举报

jaly50 发表于 2014-5-5 09:12:03 | 显示全部楼层
偏数学 不太喜欢……
princeton的算法。。java基础不牢。我都木有跟下来。。。。。=。=

要不要跟这个呢....
回复 支持 反对

使用道具 举报

readman 发表于 2014-5-5 09:44:23 | 显示全部楼层

普林斯顿的比这个实用, 普林斯顿的里面的interview题很好. 我觉得学一个足够了.
我也没跟下来, 我把视频都下载下来了, 然后作业也下来了, 准备有事没事就看看.
我最近看公司的面试, 发现好多题视频上都有讲过- =
回复 支持 反对

使用道具 举报

jaly50 发表于 2014-5-5 10:08:45 | 显示全部楼层
readman 发表于 2014-5-5 09:44
普林斯顿的比这个实用, 普林斯顿的里面的interview题很好. 我觉得学一个足够了.
我也没跟下来, 我把视频 ...

Thanks, 那我也去回顾一下~~
居然已经开始在准备面试了么……
回复 支持 反对

使用道具 举报

readman 发表于 2014-5-5 11:41:19 | 显示全部楼层
jaly50 发表于 2014-5-5 10:08
Thanks, 那我也去回顾一下~~
居然已经开始在准备面试了么……

是啊..实习去了就要开始找啊...
回复 支持 反对

使用道具 举报

麻倉枼 发表于 2014-5-5 23:38:27 | 显示全部楼层
readman 发表于 2014-5-4 20:44
普林斯顿的比这个实用, 普林斯顿的里面的interview题很好. 我觉得学一个足够了.
我也没跟下来, 我把视频 ...

今天刚signed up,那么说你是不打算要那这堂课的学分了?听上去好像你对这堂课的时间挺flexible的。。
回复 支持 反对

使用道具 举报

readman 发表于 2014-5-5 23:48:17 | 显示全部楼层
麻倉枼 发表于 2014-5-5 23:38
今天刚signed up,那么说你是不打算要那这堂课的学分了?听上去好像你对这堂课的时间挺flexible的。。

什么学分???
回复 支持 反对

使用道具 举报

麻倉枼 发表于 2014-5-6 00:30:32 | 显示全部楼层

就是这堂课的学分啊?statement of accomplishment
回复 支持 反对

使用道具 举报

glad2mu 发表于 2014-5-13 09:49:47 | 显示全部楼层
没有这门课的作业讨论吗?大家都写作业了么?
回复 支持 反对

使用道具 举报

lerota 发表于 2014-5-18 13:57:32 | 显示全部楼层
glad2mu 发表于 2014-5-13 09:49
没有这门课的作业讨论吗?大家都写作业了么?

写作业了。。。但是不知道哪里有问题,结果不对啊,编程小白可以求讨论么?
回复 支持 反对

使用道具 举报

天墨 发表于 2014-6-3 09:00:05 | 显示全部楼层
加个群。。。才上了一节课。。。
回复 支持 反对

使用道具 举报

sanguine 发表于 2014-6-13 17:25:43 | 显示全部楼层
LZ把后续的每周链接补充到帖子里吧,方便用户查看~~~辛苦了!
回复 支持 反对

使用道具 举报

本版积分规则

请点这里访问我们的新网站:一亩三分地Instant.

Instant搜索更强大,不扣积分,内容组织的更好更整洁!目前仍在beta版本,努力完善中!反馈请点这里

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明 ( 沪ICP备11015994号 )

custom counter

GMT+8, 2016-12-5 09:15

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表