荣誉版主
- 积分
- 33506
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2013-4-27
- 最后登录
- 1970-1-1
|
本帖最后由 EroicaCMCS 于 2013-12-25 21:39 编辑
shirleyma 发表于 2013-12-25 15:59 ![]()
还想问问版主,106A和61B,这两门课是同时跟好,还是先跟哪一门课,因为是转专业背景,只学过一门C语言。
有时间有能力肯定是同时跟好啦,我都恨不得一下子学很多很多的技能。。。。
61B也会讲一些基本的java,java现学现用你试试能不能跟上吧
Prerequisites看这里:
http://www.cs.berkeley.edu/~jrs/61b/overview.html
The prerequisite for CS 61B is CS 61A or Engineering 7. CS 61A is an introductory course taught in Python or Scheme, and covers topics like recursion, higher order functions, object-oriented programming, interpreters, simple data structures (lists and tables), and the basics of using the computers in our labs. E 7 covers the same topics, but is taught in Matlab. We assume that you have mastered recursion before taking 61B; if you do not have extensive practice with it, you will have difficulty with this class. Although TeleBears does not prevent someone from registering for the course without prerequisites, I won't promise that you won't be dropped from the class later.
We will be using the Java programming language in this course. Knowledge of Java is not required for this course.
If you have already taken a data structures course in any programming language (e.g., C), you may not need to take CS 61B. If you know Java too, you might be able to skip CS 61B entirely, and if you don't, you might only need to take CS 47B or CS 9G. If you feel that this course may be repeating prior experience, please see Brian Harvey in 781 Soda Hall.
If you are not familiar with the Unix operating system and basic tools, either because you did not take CS 61A, or you got through CS 61A without understanding Unix, it is important that you learn. Some student groups, including CSUA, teach help sessions on Unix.
|
|