CS61A: Structure and Interpretation of Computer Programs (Berkeley)

Berkeley CS61A: Structure and Interpretation of Computer Programs

Guide

All

01-Welcome
02-Functions
02-Functions
03-Control
03-Control
04-Higher-Order Functions
04-Higher-Order Functions
05-Environments
05-Environments
06-Abstraction
06-Abstraction
07-Function Examples
07-Function Examples
08-Midterm 1 Review
09-Recursion
09-Recursion
10-Tree Recursion
10-Tree Recursion
11-Sequences
11-Sequences
12-Containers
12-Containers
13-Objects
13-Objects
14-Linked Lists
14-Linked Lists
15-Trees
15-Trees
16-Midterm 2 Review
17-Problem Solving
18-Mutation
18-Mutation
19-Classes
19-Classes
20-Attributes
20-Attributes
21-Inheritance
21-Inheritance
22-Iterators
22-Iterators
23-Generators
23-Generators
24-Efficiency
24-Efficiency
25-Object Examples
25-Object Examples
26-Midterm 3 Review
27-Functional Programming
27-Functional Programming
28-Algebraic Data Types
28-Algebraic Data Types
29-Immutable Data
29-Immutable Data
30-Interpreters
30-Interpreters
31-No Lecture (just videos)
32-Browsers
33-Tables
34-SQL
35-Aggregation

Winda

Explains Gleam linked-list literals, homogeneous list types, standard list functions, and case-pattern matching with guards to inspect list contents.Explains Gleam list literals, shared tails, homogeneous types, list functions, and pattern matching with guards.

Save to open this file