[英文字幕] [2018 FA] UC Berkeley CS 61A SICP
详见 https://www.yuque.com/ob26eq/nshoar/kvrdpq
字幕 链接：https://share.weiyun.com/5b6Nc0R 密码：3gk4jr
视频选集
（152/213）
I Wonder if I'm Growing
01:35
1.1 Welcome to CS 61A!
08:34
1.2 An Introduction to Computer Science
06:36
1.3 Alternatives to CS 61A
05:53
1.4 Course Policies
04:14
1.5 Expressions
11:26
2.1 Announcements
02:53
2.2 Names, Assignment, and User-Defined Functions
08:47
2.3 Environment Diagrams
09:02
2.4 Defining Functions
13:50
3.1 Announcements
08:20
3.2 Print and None
07:32
3.3 Multiple Environments
10:04
3.4 Miscellaneous Python Features
11:09
3.5 Conditional Statements
06:25
3.6 Iteration
04:44
4.1 Announcements
02:57
4.2 Designing Functions
04:05
4.3 Generalization
06:50
4.4 Higher-Order Functions
14:56
4.6 Lambda Expressions
08:16
5.1 Announcements
01:09
5.2 Environments for Higher-Order Functions
05:35
5.3 Local Names
02:44
5.4 Function Composition
05:12
5.5 Self-Reference
05:51
6.1 Announcements
03:55
6.2 Iteration Example Fibonacci Numbers
06:34
6.5 Function Example Sounds
14:36
7.1 Announcements
02:43
7.2 Recursive Functions
07:11
7.3 Recursion in Environment Diagrams
09:20
7.4 Verifying Recursive Functions
02:33
7.5 Mutual Recursion
04:52
7.6 Recursion and Iteration
04:03
8.1 Announcements
04:12
8.2 Order of Recursive Calls
07:19
8.3 Example Inverse Cascade
02:42
8.4 Tree Recursion
09:56
8.5 Example Counting Partitions
11:09
9.1 Announcements
03:38
9.2 Abstraction
07:41
9.3 Testing
07:50
9.4 Currying
04:00
9.5 Decorators
04:56
9.6 Review
16:48
10.1 Announcements
02:39
10.2 Data Abstraction
06:34
10.3 Pairs
08:33
10.4 Abstraction Barriers
07:42
10.5 Data Representations
06:21
11.1 Announcements
03:42
11.2 Lists
03:36
11.3 Containers
02:22
11.4 For Statements
07:08
11.5 Ranges
05:32
11.6 List Comprehensions
03:38
11.7 Strings
04:56
11.8 Dictionaries
05:51
12.1 Announcements
00:24
12.2 Box-and-Pointer Notation
03:30
12.3 Slicing
02:38
12.4 Processing Container Values
06:12
12.5 Trees
08:00
12.6 Tree Processing
08:53
12.7 Example Printing Trees
02:04
13.1 Announcements
01:02
13.2 Objects
05:48
13.3 Example Strings
07:00
13.4 Mutation Operations
07:41
13.5 Tuples
05:18
13.6 Mutation
05:59
14.1 Announcements
01:06
14.2 Mutable Functions
09:59
14.3 Non-Local Assignment
08:18
14.4 Multiple Mutable Functions
08:42
14.5 Environment Diagrams
06:18
15.1 Announcements
03:30
15.2 Object-Oriented Programming
05:34
15.3 Class Statements
05:57
15.4 Methods
08:27
15.5 Attributes
06:48
16.1 Announcements
00:49
16.2 Attributes
02:22
16.3 Attribute Assignment
05:43
16.4 Inheritance
09:58
16.5 Object-Oriented Design
08:45
16.6 Attributes Lookup Practice
09:49
16.7 Multiple Inheritance
03:04
16.8 Complicated Inheritance
02:37
17.1 Announcements
01:00
17.2 String Representations
08:14
17.3 Polymorphic Functions
11:48
17.4 Special Method Names
09:52
18.1 Announcements
01:27
18.2 Measuring Efficiency
04:29
18.3 Memoization
06:19
18.4 Space
07:00
18.5 Time
05:47
18.6 Orders of Growth
09:59
18.7 Exponentiation
06:48
18.8 Comparing Orders of Growth
05:45
19.1 Announcements
01:10
19.2 Linked Lists
09:08
19.3 Property Methods
04:14
19.4 Tree Class
06:38
19.5 Tree Mutation
04:19
20.1 Announcements
01:02
20.2 Sets
04:14
20.3 Sets as Linked Lists
06:41
20.4 Sets as Ordered Linked Lists
07:27
20.5 Set Operations
04:48
20.6 Set Mutation
05:07
21.1 Announcements
00:52
21.2 Binary Trees
07:38
21.3 Binary Search Trees
09:53
21.4 Sets as Binary Search Trees
07:55
21
00:21
22.1 Announcements
03:09
22.2 Lists
08:02
22.3 Objects
07:46
22.5 Trees
10:37
22
00:21
23 Users
02:13
Doing with Images Makes Symbols by Alan Kay
48:21
24.1 Announcements
02:54
24.2 Scheme
07:51
24.3 Special Forms
06:58
24.4 Scheme Interpreters
01:03
24.5 Lambda Expressions
01:21
24.6 Pairs and Lists
11:07
24.7 Symbolic Programming
04:23
25.1 Announcements
00:18
25.3 Exceptions
05:33
25.4 Raising Exceptions
04:46
25.5 Try Statements
09:30
25.6 Example Reduce
05:30
25.7 Sierpinski's Triangle
04:40
26.1 Announcements
00:48
26.3 Parsing
09:47
26.4 Scheme-Syntax Calculator
07:57
26.5 Evaluation
06:27
26.6 Interactive Interpreters
05:50
27.1 Announcements
02:57
27.2 Interpreting Scheme
04:07
27.3 Special Forms
07:30
27.4 Logical Forms
02:58
27.5 Quotation
02:51
27.6 Lambda Expressions
04:04
27.7 Define Expressions
05:36
28.1 Announcementss
03:05
28.2 Dynamic Scope
02:44
28.3 Tail Recursion
07:01
28.4 Tail Calls
12:04
28.5 Tail Recursion Examples
04:33
28.6 Map and Reduce
07:24
28.7 General Computing Machines
02:06
29.1 Quasi-Quotation
01:08
29.2 Programs as Data
07:16
29.3 Macros
10:29
29.4 For Macro
03:12
29.5 Quasi-Quotation
04:06
30.1 Announcements
00:38
30.2 Announcements
05:33
30.3 Iterators
07:04
30.4 For Statements
05:35
30.5 Built-In Iterator Functions
07:29
30.6 Generators
03:57
30.7 Generators & Iterators
04:29
31.1 Announcements
00:37
31.2 Efficient Sequence Processing
08:08
31.3 Streams
06:24
31.4 Infinite Streams
02:03
31.5 Stream Processing
04:15
31.6 Higher-Order Stream Functions
03:53
31.7 Promises
05:03
32.1 Announcements
02:47
32.2 Declarative Languages
06:30
32.3 Structured Query Language (SQL)
08:06
32.4 Projecting Tables
04:35
32.5 Arithmetic
06:48
33.1 Announcements
00:24
33.2 Joining Tables
05:43
33.3 Aliases and Dot Expressions
08:51
33.5 Numerical Expressions
04:53
33.6 String Expressions
05:28
34.1 Announcements
00:31
34.2 Aggregation
10:48
34.4 Groups
06:43
34.5 Select Grammar
03:27
35.1 Announcements
00:45
35.2 Create Table and Drop Table
03:31
35.3 Modifying Tables
07:04
35.4 Python and SQL
04:10
35.5 SQL Injection Attack
03:51
35.6 Database Connections
11:39
36.1 Announcements
01:03
36.2 Unix
09:47
36.3 Big Data
03:28
36.4 Apache Spark
09:59
36.5 MapReduce
09:46
37.1 Announcements
01:10
37.2 Ambiguity
05:05
37.3 Syntax Trees
04:06
37.4 Grammars
09:53
37.5 Parsing
08:48
37.6 Learning
09:26
37.8 Translation
06:38
38 Conclusion
01:34
5.3 Environments for Nested Definitions
09:13
26.3-1 Reading Scheme Lists
07:16
22.4 Mutable Linked Lists
03:31
repeat
05:51
顶部