一道题不建议想过多的时间,如果不会就直接去看GitHub上其他人的solution或者官方的solution,非常非常非常建议看官方的solution,简洁,美观,有数学的韵味(笔者的GitHub上有官方的solution,链接放这里:half-dreamer/CS61A-20fa下的CS61A 2020 FALL all-solution 由于使用的语言是Python,所以除了官方推荐的vscode,Pycharm...
Lab 0: Getting Started | CS 61A Fall 2020 (berkeley.edu) In my case ,I have installed Python and Git before ,so I just started at Git-Bash.Because I didn't choose "Use Windows' default console window" option ,so I had to type winpty python to run the python .Thanks...
三、学习过程 课程选择:笔者选择的是2020Fall的版本https://inst.eecs.berkeley.edu/~cs61a/fa20/(其他版本修改后缀即可)个人比较推荐的是20fa和21fa的版本,讲师都是John DeNero,John DeNero的发音标准,而且语速偏慢,不用太担心听不懂的问题。而且他的讲课也很有意思,笔者印象最深的是他在讲到data abstraction...
Q1: Num eights HW2 Description:https://inst.eecs.berkeley.edu/~cs61a/fa20/hw/hw02/ 我会把题目倒着放,因为通常后面的题能带给我的思考更多(也更可能做不出来😂)…… 放在后面我以后revisit的机会就更少了～ 回到顶部 Q5: Anonymous factorial (并没有做出来) The recursive factorial function can b...
【完结🎉】UCB CS 61A: Computer Programs, Fall 2020 22.9万播放 Lecture 1. Computer Science 55:44 Lab 0. Setup 22:49 Lecture 2. Functions 49:42 Lecture 2. Q&A 38:56 Homework 1. Hints 22:43 Lecture 3. Control 57:10 Lecture 3. Q&A 39:08 Lecture 4. Higher-Order Functions 1:15:...
https://github-3rr0r.github.io/2022/01/06/CS61A-05-Environments/ UC Berkeley CS61A —— The Structure and Interpretation of Computer Programs —— Lecture 5 —— 环境github-3rr0r added Gitalk a258e61e179419b154c0860511172981 labels Jan 6, 2022 ...
ZlatanCN / UCB-CS61A-Fall-2020 Star 36 Code Issues Pull requests CS 61A: Structure and Interpretation of Computer Programs python cs61a self-learning ucberkeley Updated Aug 29, 2023 Python xuyanshi / cs61a-2022 Star 56 Code Issues Pull requests CS 61A: Structure and ...
cs61a Fall 2020 hw01 A Plus Abs B from operator import add, sub def a_plus_abs_b(a, b): """Return a+abs(b), but without calling abs. >>> a_plus_abs_b(2, 3) 5 >>> a_plus_abs_b(2, -3) 5 >>> # a check that you didn't change the return statement!
我只备份了fall2020的答案。LAB和HW都有自动测试autograder不需要看答案。问题解决实践是计算机科学进步的关键,不要作弊。最想说的一点是浪费时间。比如TEXTBOOK 和练习,有些章节看不懂完全不理解很懊恼,有些有数学知识被吓到了,有些练习苦思冥想一直钻牛角尖。然后转头去做其他事情。当然,学习要有张弛劳逸结合。
elif n == 3: x = f3(f2(f1(x))) return x return h2 return h1 这样写的话 >>> def add1(x): ... return x + 1 >>> def times2(x): ... return x * 2 >>> def add3(x): ... return x + 3 >>> my_cycle = cycle(add1, times2, add3) ...