CS61A Exam Prep 1: Control, Higher-Order Functions
Q1: Run, K, Run An increasing run of an integer is a sequence of consecutive digits in which each d ...
原文：CS61A 学习笔记 Homework 2: Higher Order Functions
Q : Product The summation n, term function from the higher order functions lecture adds up term ... term n . Write a similar function called product that returns term ... term n . Q : Accumulate Let ...
2021-05-28 23:17 0 1863 推荐指数：
相关推荐
[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 ...
[2021 Spring] CS61A 学习笔记 Homework 7: Scheme Lists
作业说明： https://inst.eecs.berkeley.edu/~cs61a/sp21/hw/hw07/ 目录 Q1: Filter Lst Q2: Interleave Q3: Accumulate Q4: Without Duplicates ...
[2021 Spring]CS61A 学习笔记 Homework 3: Recursion
作业说明：https://inst.eecs.berkeley.edu/~cs61a/sp21/hw/hw03/#required-questions 目录 Q1: Num eights Q2: Ping-pong Q3: Missing Digits Q4 ...
[2021 spring] CS61A Lab 2: Higher-Order Functions, Lambda Expressions
lab02：https://inst.eecs.berkeley.edu/~cs61a/sp21/lab/lab02/#topics 目录 快速回顾： Lambda Expressions Environment Diagrams ...
[2021 Spring] CS61A 学习笔记 Homework 4: Trees, Data Abstraction
作业地址： https://inst.eecs.berkeley.edu/~cs61a/sp21/hw/hw04/ 目录 Abstraction Q1: Weights Q2: Balanced Q3: Totals Trees ...
[2021 Spring] CS61A 学习笔记 Homework 9: Regular Expressions, BNF, Macros
作业地址： https://inst.eecs.berkeley.edu/~cs61a/sp21/hw/hw09/ 目录 Q1-Q3 Q4: Switch Q1-Q3 对BNF的理解 对RE的理解 对interpreters的理解 Q4 ...
[2021 Spring] CS61A 学习笔记 Homework 5: Object-Oriented Programming, Linked Lists, Iterators and Generators
作业说明： https://inst.eecs.berkeley.edu/~cs61a/sp21/hw/hw05/ 目录 Q1: 自动售货机 Q2: Store Digits Q3: Yield Paths Q4: Mint 铸币厂 Q5: Is BST ...