CS61A-2021-Summer: Introduction to Computer Science I

How to use CS61A

Goto https://cs61a.org/, scroll down, see Lab, Discussion, & Exam Prep Links and Homework & Project

Download the zip, unzip and cd into the directory. After finishing the code, run python3 ok (you may need to unlock the test first) https://cs61a.org/lab/lab00/#doing-the-assignment

This project is for https://inst.eecs.berkeley.edu/~cs61a/su21/

current progress:

lab

• 0

• 1

• 2

• 3

• 4

• 5

• 6

  • https://inst.eecs.berkeley.edu/~cs61a/su21/lab/lab06/#q3

  https://inst.eecs.berkeley.edu/~cs61a/su21/lab/sol-lab06/#q3

  list monad

  换另一种说法 - 那道题是在考你 nondeterministic prorgamming （在代码中加入 nondeterminism）

  比如说，你可以想想有如下函数

  amb: a -> a -> a

  runAmb: (() -> a) -> list a

• 7

• 8

• 9

• 10 https://www.cnblogs.com/ikventure/p/15047654.html

• 11

• 12

• 13

  • https://inst.eecs.berkeley.edu/~cs61a/su21/lab/lab13/#q5
  • https://inst.eecs.berkeley.edu/~cs61a/su21/lab/lab13/#q14

homework

• 1

• 2

• 3

• 4

  • in remainders_generator, I skip the type check since itertools.count isn't a Generator.

• 5

  • https://inst.eecs.berkeley.edu/~cs61a/su21/hw/hw05/#q3

    https://blog.csdn.net/weixin_45450521/article/details/113959914

• 6

• 7

  https://inst.eecs.berkeley.edu/~cs61a/su21/hw/hw07/#q6 This should be tallest instead of above_average

  • https://inst.eecs.berkeley.edu/~cs61a/su21/hw/hw07/#q7

• 8

  This homework has nothing you need to submit to ok.

project

• hog
• cats
• ants
  • Optional2
  • Optional3

    ContainerAnt 这个 class 是没图的，但是默认设置会尝试载入图. 要手动把代码改掉 self.ant_types = {a.name: a for a in ant_types if a != ContainerAnt}

• scheme
• scheme_stubbed (这个是加强版的 scheme, 就不做了)

---

Highlight

• Strong Typed PEP 484
• Modern syntax
• PEP 8 format black