📣 黑五价提前开抢|VIP一年通行证5折,蓝莓、Offer多多同步特惠
查看: 6639| 回复: 4
跳转到指定楼层
上一主题 下一主题
收起左侧

有兴趣一起上课的吗?CS61C,Stanford Algorithm, ML

全局:
公开课
学校名称: Stanford, UCBerkely
Unit号: 10
开课时间: 05/22
课程全名: CS61C Great Ideas
平台: 其他

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

您需要 登录 才可以下载或查看附件。没有帐号?注册账号

x
暑假开始了,最近对计算机架构和平行(并行)算法感兴趣,而且下学期有一门高阶的computer archiecture. 看上了berkely的CS61C。这门课主要介绍计算机基本的结构,e.g., instruction, cache, virtual memory, I/O,另外,还涉及MapReduce,GPU programming, Multithread programming (OpenMP),用到的语言是C。想写并行算法和GPU编程,对C有一定的了解肯定是逃不掉的。我选的是14SP的,因为这课评价最高,内容也是最全的,缺点是对C的讲解只有2节课的时间,而其他年限都是3-4节课,所以我们上课的时候,可以多看看其他年限的C的那一部分就可以了。
CS61C: http://www-inst.eecs.berkeley.edu/~cs61c/sp14/


另外,个人觉得不错的课还有stanford的Algorithm,比较理论,也是学CS绕不过的课。个人感觉理论课程最重要的还是要理解,第一次学理解基本算法最重要,复杂的变换和如何应用其实是次要的,因为总要刷题,总有不会做的题,当你刷题遇到不会的题的时候,如果你心里想的是,“这题还能用这个算法解?”,而不是,“还有一个算法叫这个?”,应该会踏实很多。

我的微信:sky_ytdx
有兴趣一起的,可以留言,或者加我微信


上一篇:零基础/转码/弱渣 求同伴一起学习CS61B
下一篇:一起上普利斯顿 算法公开课
🔗
 楼主| sky420 2017-5-16 05:45:10 | 只看该作者
全局:
First lecture overviews the contents of the course. This course contains the six most significant ideas in computer architectures such as abstraction, Moore's law. principle of locality and memory hierarchy, parallelism, performance measurement/improvement, and dependability via redundancy.

One interesting thing is in Moore's law, the trend is still true (number of transistors per circuit is doubled every year), even the speed of CPU is not improved a lot. Jim Gray offered a very good analogy about how far away the data in computer. Parallelism has a limit that is due to the portion of code that can be carried out in parallel.

To my surprise, the four projects involve 'advanced' technique such as MapReduce, GPU programming, and Parallel computing.     
回复

使用道具 举报

🔗
 楼主| sky420 2017-5-17 03:49:40 | 只看该作者
全局:
Lecture Two introduces the concept of number representation, i.e., everything can be represented in bits. It is basic and important, especially for hardware. Four different representations are introduced.

First, unsigned is a N length long bits, which can represent 2^N different things. Since the unsigned cannot represent negative number so signed is introduced by using the left most bit as sign bit. The one's complement (flip) is introduced as the unsigned has two zeros and bad monotonicity. The two-zero issue is solved in two's complement (flip and add one) with simple formula: minus 2^(N-1) but bad monotonicity is still a problem. The two issues are finally solved via bias representation, which is unsigned adding a bias (e.g., -2^(N-1)-1).

If a number is too big/small to be represented, this is called overflow.
回复

使用道具 举报

无效楼层,该帖已经被删除
🔗
hyforever 2017-12-19 12:03:28 | 只看该作者
全局:
想请教下楼主cs61c的课程视频大概在哪里有资源能看呢?
谢谢!
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册账号
隐私提醒:
  • ☑ 禁止发布广告,拉群,贴个人联系方式:找人请去🔗同学同事飞友,拉群请去🔗拉群结伴,广告请去🔗跳蚤市场,和 🔗租房广告|找室友
  • ☑ 论坛内容在发帖 30 分钟内可以编辑,过后则不能删帖。为防止被骚扰甚至人肉,不要公开留微信等联系方式,如有需求请以论坛私信方式发送。
  • ☑ 干货版块可免费使用 🔗超级匿名:面经(美国面经、中国面经、数科面经、PM面经),抖包袱(美国、中国)和录取汇报、定位选校版
  • ☑ 查阅全站 🔗各种匿名方法

本版积分规则

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