CS61A

首页 > TAG信息列表 > CS61A

CS61A spring 2022

CS61A spring 2022 CS61A 通关感想 github仓库：duilec/CS61A-spring-2022 耗时：150~200 hours 很认真地写了注释，做了笔记。敲代码，写注释和做笔记的比重各占三分之一，其实还不少时间去查阅资料面向对象编程的时候，真的很考验英文阅读能力，一不小心就理解出错递归真令人又爱又恨 sche

[CS61A] Lecture 4. Higher-Order Functions & Project 1: The Game of Hog

[CS61A] Lecture 4. Higher-Order Functions & Project 1: The Game of Hog Lecture Lecture 4. Higher-Order Functions 本节课介绍了高阶函数的概念与用法，主要包含如下内容：从斐波那契数列说起，定义fib函数并使用迭代法解答。面积公式，介绍正方形、五边形以及圆形的面积公式，它们

2021 fall cs61a dis14

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/disc/disc14/ 目录problem1：problem2：problem3:problem4:probelm5:probelm 6:problem7：problem9and10 problem1：就是两种情况考虑，然后加起来就好了 def paths(x, y): """Return a list of ways to reach y from x b

2021 fall cs61a lab13

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/lab/lab13/ .read data.sql CREATE TABLE bluedog AS SELECT color, pet FROM students WHERE color = 'blue' AND pet = 'dog'; CREATE TABLE bluedog_songs AS SELECT color

2021 fall cs61a hw09

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/hw/hw09/#q3-cs-classes problem1：了解正则表达式规则就可以写了 problem2：匹配[IVXLCDM],不能匹配出现在其他单词里面的用 \b，出现至少一次用+ return re.findall(r"\b[IVXLCDM]\b+", text) problem3： return bo

2021 fall cs61a hw07

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/hw/hw07/#q3-pow problem1： problem2： problem3：

2021 fall cs61a lab10

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/lab/lab10/ problem1： problem1-6：

2021 fall cs61a dis08

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/disc/disc08/ problem1： problem2： problem3: 递归 def sum_nums(s): """ >>> a = Link(1, Link(6, Link(7))) >>> sum_nums(a) 14 "&qu

2021 fall cs61a hw06

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/hw/hw06/ problem1：没什么难度就是看清楚逻辑照着写就好了 class VendingMachine: """A vending machine that vends some product for some price. >>> v = VendingMachine('candy', 1

2021 fall cs61a hw05

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/hw/hw05/#required-questions def gen_perms(seq): """Generates all permutations of the given sequence. Each permutation is a list of the elements in SEQ in a different order. T

2020 cs61a lab06

网址 https://inst.eecs.berkeley.edu/~cs61a/fa20/lab/lab06/#topics problem124： this_file = __file__ def make_adder_inc(a): """ >>> adder1 = make_adder_inc(5) >>> adder2 = make_adder_inc(6)

cs61a 2021 fall dis06

网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/disc/disc06/#q1-wwpd-mutability problem1： problem2： problem3： problem4： problem5: problem6: problem7:

Hw08 of CS61A of UCB

Q1: My Filter Write a procedure my-filter, which takes a predicate func and a list lst, and returns a new list containing only elements of the list that satisfy the predicate. The output should contain the elements in the same order that they appeared in

Hw06 of CS61A of UCB

OOP Q1: Vending Machine In this question you'll create a vending machine that only outputs a single product and provides change when needed. Create a class called VendingMachine that represents a vending machine for some product. A VendingMachineob

Lab10 of CS61A of UCB

Q2: Over or Under Define a procedure over-or-under which takes in a number num1 and a number num2 and returns the following: -1 if num1 is less than num2 0 if num1 is equal to num2 1 if num1 is greater than num2 Challenge: Implement this in 2 differen

CS61A 01 Intro

学习CS-61A个人体会现在我刚好学到11节，期中考试之前的最后一节，算是学过一半了。当初想要学CS-61A是我一个朋友和我介绍的，放假后没什么事干，本这实在不行学个英语也行的态度开始了61A的学习。和国内课程的区别我就读于西安电子科技大学，目前大一上了2个有关编程的课，大一上的计算

Lab06 of CS61A of UCB

Mutability Write a function which takes in a list lst, an argument entry, and another argument elem. This function will check through each item in lst to see if it is equal to entry. Upon finding an item equal to entry, the function should modify the li

hw04 of CS61A of UCB

Mobiles Q2: Weights Implement the planet data abstraction by completing the planet constructor and the size selector so that a planet is represented using a two-element list where the first element is the string 'planet' and the second element

CS61A笔记1

week01笔记开篇课程是Summer2020的https://inst.eecs.berkeley.edu/~cs61a/su20/ 我水平有限，这也就只能当笔记看看，无任何指导价值，样例多来自于课程中。相似课程以下课程只是与CS61A教学内容有部分重叠 CS10CS88Data8 学习目的作为计算机科学的介绍(Intruduction t

[2021 Spring] CS61A 学习笔记 Homework 7: Scheme Lists

作业说明： https://inst.eecs.berkeley.edu/~cs61a/sp21/hw/hw07/ 目录Q1: Filter LstQ2: InterleaveQ3: AccumulateQ4: Without Duplicates Q1: Filter Lst 类似内置函数filter (define (filter-lst fn lst) (if (null? lst) lst (if (fn (car lst))

[2021 Spring] CS61A 学习笔记 lecture 25 Scheme Examples

目录Translate to SchemeReview of Iteration via Tail RecursionTail-Recursive Version of countAnother Higher-Order Function Example: MapReverseTail-Recursive ReverseTrees Recursions Translate to Scheme 将python program转换成Scheme version。 # python版本 def cou

[2021 Spring] CS61A 学习笔记 Homework 6: Scheme

hw06： https://inst.eecs.berkeley.edu/~cs61a/sp21/hw/hw06/#scheme-editor CS 61A Scheme Specification： https://inst.eecs.berkeley.edu/~cs61a/sp21/articles/scheme-spec/ Scheme Built-In Procedure Reference： https://inst.eecs.berkeley.edu/~cs61a/sp21/articles/

[2021 Spring] CS61A Project 3: Ants Vs. SomeBees 效果展示

项目说明：https://inst.eecs.berkeley.edu/~cs61a/sp21/proj/ants/ 蚂蚁大战蜜蜂灵感来源：植物大战僵尸（Plants Vs. Zombies，PVZ） Phase 1： https://www.cnblogs.com/ikventure/p/14986805.html Phase 2： https://www.cnblogs.com/ikventure/p/14988467.html Phase 3： https://www.cnblog

[2021 Spring] CS61A Project 3: Ants Vs. SomeBees (Phase 1)

项目说明：https://inst.eecs.berkeley.edu/~cs61a/sp21/proj/ants/ 蚂蚁大战蜜蜂灵感来源：植物大战僵尸（Plants Vs. Zombies，PVZ）样图：目录游戏说明Phase 1: Basic gameplayProblem 1 (1 pt)Problem 2 (2 pt)Problem 3 (2 pt) 游戏说明游戏按轮次进行，每一轮中，新的蜜蜂都可能进入蚁

[2021 spring] CS61A Project 2: CATS (CS 61A Autocorrected Typing Software)

项目说明： https://inst.eecs.berkeley.edu/~cs61a/sp21/proj/cats/#introduction 自动纠错打字软件 """Typing test implementation""" from utils import lower, split, remove_punctuation, lines_from_file from ucb import main, interact, trace fro