【完结】【CS61A精翻双语·英文原声】伯克利大学《计算机程序的结构与解释》(2024)
14.9万
863
2024-06-28 21:10:00
未经作者授权，禁止转载
正在缓冲...
2717
2411
9234
1050
说到CS 61A，不得不提及一部与该课程同名的经典著作 《Structure and Interpretation of Computer Programs》，中文译本 《计算机程序的构造和解释》也就是大名鼎鼎的SICP。很多大学的计算机专业本科程序设计「导论」课程都以SICP为教材，其中大家较为熟知的有
MIT6.001 由SICP的作者之一 Hal Abelson 授课。以LISP的变体scheme为授课语言。
UCB cs61a Brian Harvey 开设的 SICP 课程,该课程也是以scheme为授课语言。Spring 2011是该课程的最后一版，后续的课程更新为以Python为授课语言。比起 MIT 的课程，它更加完善，更适用于初学者。
John DeNero 讲授的更新的 CS 61A 课程,升级后的课程继承了SICP但使用Python语言讲解。而且为课程重新编写了配套书籍 Composing Programs。 考虑到python是当下使用范围最广的编程语言之一且学习难度低，所以本指南选用UCB更新后的 CS 61A 课程。但强烈建议学有余力的同学阅读 SICP 结合 Brian Harvey 的 CS61a 课程学习SICP。因为 SICP 是独一无二的，它可以很有可能改变你对计算机和编程的基本认识。不是每个人都有这样的体验。有的人讨厌这本书，有的人看了前几页就放弃了。但潜在的回报让它值得一读。 cs61a（新版） 提供了丰富的课程资源包括：
课程网站：https://cs61a.org/
Videos | 提前录制的由John DeNero 授课的课程视频
Recordings | 课堂实录（内容跟video一样，需要登陆 bcourses.berkeley.edu 账号才能观看）
slides | 课程PPT
Textbook | 阅读教材
Lab | 实验
Discussions | 讨论环节的问题集
Homework | 作业
Projects | 项目
虽然CS50,CS61a 都是CSEE学科的编程入门基础课程，但是直接上手CS61A 对学习能力有一定的要求，所以建议先学习CS50x，然后学习CS61A，以免因学习难度过高而导致信心受挫。
CS自学路径图---英文原声版
（3/14）
自动连播
43.2万播放
简介
订阅合集
【Python推荐学习课程】世界上最受欢迎的编程课程-Python for everybody
1.Python for Everybody - The most popular programming course in the world
01:42
2.PY4E - Introduction (Chapter 1 Part 1)
12:31
3.PY4E - Introduction (Chapter 1 Part 2)
12:16
4.THG Video - What happens when the cooler is removed？
02:18
5.Inside of Hard Drive
01:56
6.PY4E - Introduction (Chapter 1 Part 3)
07:49
7.PY4E - Introduction (Chapter 1 Part 4)
12:36
8.Welcome to Python Programming
01:06
9.Installing Python 3 on Windows-10
06:24
10.Installing a Python 3 on a Macintosh
09:05
11.Worked Exercise - Hello World
05:14
12.PY4E - Introduction (Chapter 2 Part 1)
09:42
13.PY4E - Introduction (Chapter 2 Part 2)
19:54
14.Worked Exercise 2.2
06:12
15.Worked Exercise 2.3
07:49
16.PY4E - Conditionals (Chapter 3 Part 1)
11:07
17.PY4E - Conditionals (Chapter 3 Part 2)
13:52
18.Worked Exercise 3.1
12:07
19.Worked Exercise 3.2
09:26
20.PY4E - Functions (Chapter 4 Part 1)
10:30
21.PY4E - Functions (Chapter 4 Part 2)
12:36
22.Worked Exercise 4.6
10:09
23.PY4E - Loops and Iteration (Chapter 5 Part 1)
09:59
24.PY4E - Loops and Iteration (Chapter 5 Part 2)
06:52
25.PY4E - Loops and Iteration (Chapter 5 Part 3)
08:44
26.PY4E - Loops and Iteration (Chapter 5 Part 4)
18:49
27.Worked Exercise 5.1
08:31
28.PY4E - Strings (Chapter 6 Part 1)
10:43
29.PY4E - Strings (Chapter 6 Part 2)
18:45
30.Worked Exercise 6.5
08:27
31.PY4E - Files (Chapter 7 Part 1)
07:55
32.PY4E - Files (Chapter 7 Part 2)
13:47
33.Worked Exercise 7.1 - Opening and Reading a File
09:45
34.PY4E - Python Lists (Chapter 8 Part 1)
10:58
35.PY4E - Python Lists (Chapter 8 Part 2)
09:37
36.PY4E - Python Lists (Chapter 8 Part 3)
08:03
37.Strings Files Lists and the Guardian Pattern (Chapter 8)
12:01
38.PY4E - Dictionaries (Chapter 9 Part 1)
09:52
39.PY4E - Dictionaries (Chapter 9 Part 2)
09:27
40.PY4E - Dictionaries (Chapter 9 Part 3)
11:24
41.Counting Word Frequency using a Dictionary (Chapter 9)
26:26
42.PY4E - Tuples (Chapter 10 Part 1)
09:49
43.PY4E - Tuples (Chapter 10 Part 2)
12:24
44.Sorting a Dictionary using Tuples (Chapter 10)
12:42
45.PY4E - Regular Expressions (Chapter 11 Part 1)
10:48
46.PY4E - Regular Expressions (Chapter 11 Part 2)
08:48
47.PY4E - Regular Expressions (Chapter 11 Part 3)
08:52
48.PY4E - HTTP (Chapter 12 Part 1)
07:44
49.PY4E - HTTP (Chapter 12 Part 2)
09:21
50.PY4E - HTTP (Chapter 12 Part 3)
04:37
51.Worked Example： Sockets (Chapter 12)
06:12
52.PY4E - Unicode and UTF-8 in Python (Chapter 12 Part 4)
11:15
53.PY4E - HTTP (Chapter 12 Part 5)
05:31
54.Worked Example： Using Urllib (Chapter 12)
03:40
55.PY4E - HTTP (Chapter 12 Part 6)
06:40
56.Worked Example： BeautifulSoup (Chapter 12)
09:21
57.PY4E - Web Services (Chapter 13 Part 1)
02:49
58.PY4E - Web Services - XML (Chapter 13 Part 2)
05:44
59.Worked Example： XML (Chapter 13)
06:07
60.PY4E - Web Services - XML Schema (Chapter 13 Part 3)
14:09
61.PY4E - Web Services - JSON (Chapter 13 Part 4)
06:29
62.Worked Example： JSON (Chapter 13)
05:51
63.Discovering JavaScript Object Notation with Douglas Crockford
07:08
64.PY4E - Web Services - SOA (Chapter 13 Part 5)
02:02
65.JISC e-Framework
05:17
66.PY4E - Web Services - GeoJSON (Chapter 13 Part 6)
08:47
67.Worked Example： OpenGeo.py (Chapter 13)
20:09
68.PY4E - Python Objects (Chapter 14 Part 1)
10:41
69.PY4E - Python Objects (Chapter 14 Part 2)
08:22
70.PY4E - Python Objects (Chapter 14 Part 3)
06:09
71.PY4E - Python Objects (Chapter 14 Part 4)
07:35
72.PY4E - Databases (Chapter 15 Part 1)
15:42
73.PY4E - Databases - Single Table SQL (Chapter 15 Part 2)
10:08
74.Worked Example： Emaildb.py (Chapter 15)
13:40
75.PY4E - Database - Complex Models (Chapter 15 Part 3)
08:44
76.PY4E - Databases (Chapter 15 Part 4)
04:06
77.PY4E - Databases - Foreign Keys (Chapter 15 Part 5)
11:33
78.Worked Example： Tracks.py (Chapter 15)
07:56
79.PY4E - Databases - JOIN (Chapter 15 Part 6)
10:31
80.PY4E - Databases - Many-to-Many (Chapter 15 Part 7)
13:14
81.Worked Example： Roster.py (Chapter 15)
11:27
82.PY4E - Visualization (Chapter 16 Part 1)
06:44
83.Worked Example： OpenGeo (Chapter 16)
18:47
84.PY4E - Visualization (Chapter 16 Part 2)
11:25
85.Worked Example： Page Rank - Spidering (Chapter 16)
17:26
86.Worked Example： Page Rank - Computation (Chapter 16)
15:38
87.Worked Example： Page Rank - Visualization (Chapter 16)
06:43
88.PY4E - Visualization (Chapter 16 Part 3)
06:59
89.Worked Example： Gmane ⧸ Mail - Retrieval (Chapter 16)
17:01
90.Worked Example： Gmane ⧸ Mail - Model (Chapter 16)
12:56
91.Worked Example： Gmane ⧸ Mail - Visualization (Chapter 16)
13:33
92.MOOC Graduation Video with Curt Bonk as Commencement Speaker
07:26
CS50《计算机科学导论》(2023)
0 - Scratch
02:09:30
1 - C
02:29:34
2 - Arrays
02:24:20
3 - Algorithms
02:01:36
4 - Memory
02:25:20
5 - Data Structures
02:16:12
6 - Python
02:15:19
7 - SQL
02:20:29
8 - HTML CSS JavaScript
02:39:45
Cybersecurity
45:55
9 - Flask
02:20:53
10 - Emoji
01:46:21
CS61A《计算机程序的结构与解释》(2024)
Lecture 1 Welcome
13:29
Lecture 2 Functions-en
40:20
Lecture 3 Control-en
32:21
Lecture 4 Higher-Order Functions-en
42:53
Lecture 5 Environments-en
36:42
Lecture 6 Sound (Optional)-en
14:36
Lecture 7 Functional Abstraction-en
30:05
Lecture 8 Function Examples-en
34:16
Lecture 9 Recursion-en
37:49
Lecture 10 Tree Recursion-en
32:14
Lecture 11 Sequences-en
22:15
Lecture 12 Containers-en
27:53
Lecture 13 Data Abstraction-en
29:08
Lecture 14 Trees-en
34:32
Lecture 15 Mutability-en
37:58
Lecture 16 Iterators-en
29:29
Lecture 17 Generators-en
17:13
Lecture 18 Objects-en
17:15
Lecture 19 Attributes-en
17:47
Lecture 20 Inheritance-en
31:35
Lecture 21 Representation-en
30:31
Lecture 22 Composition-en
33:16
Lecture 23 Efficiency-en
36:37
Lecture 24 Decomposition-en
27:16
Lecture 25 Data Examples-en
38:37
Lecture 28 Scheme-en
31:14
Lecture 29 Scheme Lists-en
24:44
Lecture 30 Calculator-en
47:54
Lecture 31 Interpreters-en
29:48
Lecture 32 Tail Calls (Optional)-en
32:50
Lecture 33 Programs as Data-en
18:06
Lecture 34 Macros-en
28:53
Lecture 35 SQL-en
25:43
Lecture 36 Tables-en
24:54
Lecture 37 Aggregation-en
17:30
Lecture 38 Databases (Optional)-en
26:22
Lecture 39 Final Examples-en
38:48
CS61B《算法与数据结构》(2024)
Lecture 1 - Introduction
48:50
Lecture 2 - Defining and Using Classes
51:18
Lecture 3 - Lists I References Recursion and Lists
46:59
Lecture 4 - Lists II SLLists
49:11
Lecture 5 - Lists 3 DLLists and Arrays
50:49
Lecture 6 - Testing
47:57
Lecture 7 - Lists IV Arrays and Lists
48:53
Lecture 8 - Inheritance I Interface and Implementation Inheritance
49:47
Lecture 9 - Inheritance II Extends Casting Higher Order Functions
50:35
Lecture 10 - Inheritance III Subtype Polymorphism Comparators Comparable
50:50
Lecture 11 - Inheritance IV Iterators Object Methods
59:15
Lecture 12 - Asymptotics I
51:12
Lecture 13 - Midterm Review
52:35
Lecture 14 - Disjoint Sets
51:00
Lecture 15 - Disjoint Sets + Asymptotics 2
53:18
Lecture 16 - BST 1
50:58
Lecture 17 - B-Trees (2-3 2-3-4 Trees)
51:27
Lecture 18 - Red Black Trees
51:25
Lecture 19 - Hashing I
49:31
Lecture 20 - Hashing 2
51:44
Lecture 21 - Heaps and Priority Queues
52:37
Lecture 22 - Tree and Graph Traversals
51:47
Lecture 23 - Graph Traversals and Implementations
51:42
Lecture 24 - Shortest Paths
51:37
Lecture 25 - Minimum Spanning Trees
52:03
Lecture 26 - MSTs (continued) Directed Acyclic Graphs
49:51
Lecture 27 - Software Engineering I
50:43
Lecture 28 - Prefix Operations and Tries
51:40
Lecture 29 - Sorting I Selection Sort Heapsort
53:00
Lecture 30 - Sorting II Mergesort Insertion Sort
49:48
Lecture 31 - Software Engineering II
54:00
Lecture 32 - Sorting III： Quicksort
50:45
Lecture 33 - Sorting IV： Theoretical Bounds
51:52
Lecture 34 - Software Engineering III
54:00
Lecture 35. Sorting V - More Quicksort Radix Sorts
50:18
Lecture 36 - Sorting VI Radix vs Comparison Sorting
50:32
Lecture 37 - Software Engineering IV
54:00
Lecture 38 - Compression
42:46
Lecture 39 - Computability P=NP
47:54
Lecture 40 - Summary
55:47
CS61C《计算机体系结构》(2020)
1. LIVE Great Ideas in Computer Architecture Intro
53:20
2. Number Representation
51:49
3. C Intro: Basics
49:48
4. C Intro: Pointers, Arrays, Strings
38:34
5. C Memory Management
50:58
6. Floating Point
01:17:57
7. RISC-V Intro
37:54
8. RISC-V lw, sw, Decisions I
54:33
9. RISC-V Decisions II
26:27
10. RISC-V Procedures
40:13
11. RISC-V Instruction Formats I
52:36
12. RISC-V Instruction Formats II
50:05
13. Compilation, Assembly, Linking, Loading
01:01:29
14. Intro to Synchronous Digital Systems
37:01
15. State, State Machines
44:55
16. Combinational Logic
44:14
17. Combinational Logic Blocks
43:49
18. Single-Cycle CPU Datapath I
53:35
19. Single-Cycle CPU Datapath II
51:29
20. Single-Cycle CPU Control
01:03:08
21. Pipelining I
51:30
22. Pipelining II
49:59
23. Pipelining III
42:06
24. Caches I
43:07
25. Caches II
54:39
26. Caches III
49:41
27. Caches IV
48:26
28. OS & Virtual Memory Intro
57:34
29. Virtual Memory I
01:05:18
30. Virtual Memory II
49:22
31. I/O
42:43
32. Flynn Taxonomy, SIMD Instructions
56:18
33. Thread-Level Parallelism I
57:47
34. Thread-Level Parallelism II
39:06
35. Thread-Level Parallelism III
47:35
36. MapReduce, Spark
52:55
37. Data Centers, Cloud Computing (WSC)
50:06
38. Dependability- Parity, ECC, RAID
01:09:04
39. LIVE - GPU Guest Lecture with James Percy
50:51
40. LIVE - Summary and Goodbye
50:14
MIT18.01《单变量微积分》(2007)
1: Rate of Change
51:33
2: Limits
52:47
3: Derivatives
49:55
4: Chain Rule
46:03
5: Implicit Differentiation
49:01
6: Exponential and Log
47:57
7: Exam 1 Review
50:53
9: Linear and Quadratic Approximations
46:49
10: Curve Sketching
51:45
11: Max-min
49:42
12: Related Rates
49:56
13: Newton's Method
53:23
14: Mean Value Theorem
49:42
15: Antiderivatives
48:53
16: Differential Equations
45:25
18: Definite Integrals
47:14
19: First Fundamental Theorem
48:16
20: Second Fundamental Theorem
49:31
21: Applications to Logarithms
50:17
22: Volumes
49:58
23: Work, Probability
48:37
24: Numerical Integration
50:30
25: Exam 3 Review
49:19
27: Trig Integrals
46:45
28: Inverse Substitution
48:30
29: Partial Fractions
48:38
30: Integration by Parts
51:24
31: Parametric Equations
45:25
32: Polar Coordinates
49:23
33: Exam 4 Review
49:07
35: Indeterminate Forms
48:43
36: Improper Integrals
49:27
37: Infinite Series
50:12
38: Taylor's Series
47:31
39: Final Review
39:14
MIT18.02《多变量微积分》(2007)
Lec 1： Dot product
38:41
Lec 2： Determinants cross product
52:51
Lec 3： Matrices inverse matrices
51:05
Lec 4： Square systems equations of planes
49:03
Lec 5： Parametric equations for lines and curves
50:50
Lec 6： Velocity acceleration Kepler s second law
48:05
Lec 7： Review
49:51
Lec 8： Level curves partial derivatives tangent plane
46:13
Lec 9： Max-min problems least squares
49:44
Lec 10： Second derivative test boundaries & infinity
52:19
Lec 11： Differentials chain rule
50:10
Lec 12： Gradient directional derivative tangent plane
50:10
Lec 13： Lagrange multipliers
50:11
Lec 14： Non-independent variables
49:11
Lec 15： Partial differential equations review
45:23
Lec 16： Double integrals
48:00
Lec 17： Double integrals in polar coords applications
51:30
Lec 18： Change of variables
49:55
Lec 19： Vector fields and line integrals in the plane
51:09
Lec 20： Path independence and conservative fields
50:23
Lec 21： Gradient fields and potential functions
50:11
Lec 22： Green s theorem
46:45
Lec 23： Flux normal form of Green s theorem
50:13
Lec 24： Simply connected regions review
49:01
Lec 25： Triple integrals in rectangular cylindrical
48:42
Lec 26： Spherical coordinates surface area
51:05
Lec 27： Vector fields in 3D surface integrals flux
50:34
Lec 28： Divergence theorem
49:16
Lec 29： Divergence theorem cont. applications proof
50:13
Lec 30： Line integrals in space cur exactness
49:42
Lec 31： Stokes theorem
48:21
Lec 32： Stokes theorem (cont.) review
50:09
Lec 33： Topological considerations Maxwell s equations
28:39
Lec 34： Final review
43:54
Lec 35： Final review (cont.)
48:53
MIT18.06《线性代数》
1：线性方程的几何
39:49
2：矩阵消元法
47:42
3：乘法和逆矩阵
46:49
4.因式分解为 A = LU
48:05
5：转置、排列、空间 R^n
47:42
6：列空间和零空间
46:02
7：求解 Ax = 0：枢轴变量，特殊解
43:20
8：求解 Ax = b：行简化形式 R
47:20
9：独立性、基础和维度
50:14
10：四个基本子空间
49:20
11：矩阵空间、秩1矩阵和小世界图
45:56
12：图形，网络，关联矩阵
47:58
13：测验 1 复习
47:40
14：正交向量和子空间
49:48
15：子空间投影
48:51
16：投影矩阵和最小二乘法
48:05
17：正交矩阵和 Gram-Schmid
49:10
18：行列式的性质
49:13
19：行列式公式和余因式
53:18
20：克莱姆规则、逆矩阵和体积
51:01
21：特征值和特征向量_
51:23
22：对角化和 A 的幂
51:51
23：微分方程和 exp(At)_
51:03
24：马尔可夫矩阵；傅里叶级数
51:12
24b：测验 2 复习
48:20
25：对称矩阵和正定性
43:52
26：复矩阵；快速傅里叶变换
47:52
27：正定矩阵和最小值
50:41
28：相似矩阵和 Jordan 形式
45:56
29：奇异值分解
40:29
30：线性变换及其矩阵
49:27
31：基础的变化；图像压缩_
50:14
32：测验 3 复习
47:06
33：左逆和右逆；伪逆
41:53
34：期末课程复习
43:26
吉尔伯特·斯特朗教授谈线性代数教学
07:35
MIT 6.042J《计算机科学中的数学》(2015)
1.1.1 Welcome to 6.042
02:15
1.1.2 Intro to Proofs： Part 1
09:31
1.1.3 Intro to Proofs： Part 2
07:08
1.2.1 Proof by Contradiction
07:56
1.2.3 Proof by Cases
06:54
1.3.1 Well Ordering Principle 1
05:39
1.3.3 Well Ordering Principle 2
05:24
1.3.5 Well Ordering Principle 3
06:03
1.4.1 Propositional Operators
09:21
1.4.3 Digital Logic
10:03
1.4.4 Truth Tables
12:57
1.5.1 Predicate Logic 1
12:36
1.5.2 Predicate Logic 2
12:00
1.5.4 Predicate Logic 3
08:30
1.6.1 Sets Definitions
12:01
1.6.2 Sets Operations
09:15
1.7.1 Relations
25:13
1.7.3 Relational Mappings
08:53
1.7.5 Finite Cardinality
10:58
1.8.1 Induction
21:42
1.8.2 Bogus Induction
05:04
1.8.4 Strong Induction
10:04
1.8.6 WOP vs Induction
07:53
1.9.1 State Machines Invariants
26:01
1.9.3 Derived Variables
06:24
1.10.1 Recursive Data
12:43
1.10.4 Structural Induction
06:16
1.10.7 Recursive Functions
14:04
1.11.1 Cardinality
12:56
1.11.3 Countable Sets
09:46
1.11.4 Cantor_s Theorem
20:23
1.11.7 The Halting Problem
16:03
1.11.9 Russell_s Paradox
13:26
1.11.11 Set Theory Axioms
09:20
2.1.1 GCDs Linear Combinations
09:42
2.1.2 Euclidean Algorithm
09:30
2.1.4 Pulverizer
11:49
2.1.6 Revisiting Die Hard
05:17
2.1.7 Prime Factorization
07:49
2.2.1 Congruence mod n
13:13
2.2.3 Inverses mod n
04:17
2.3.1 Modular Exponentiation Euler_s Function
06:13
2.3.3 The Ring Z
16:51
2.4.1 RSA Public Key Encryption
21:46
2.4.3 Reducing Factoring To SAT
07:10
2.5.1 Digraphs： Walks & Paths
03:45
2.5.3 Digraphs： Connected Vertices
06:55
2.6.1 DAGs
11:23
2.6.3 Scheduling
13:17
2.6.5 Time versus Processors
09:45
2.7.1 Partial Orders
10:34
2.7.3 Representing Partial Orders As Subset Relations
06:58
2.7.4 Equivalence Relations
07:12
2.8.1 Degree
11:18
2.8.3 Isomorphism
11:04
2.9.1 Coloring
16:21
2.9.3 Connectivity
03:09
2.9.4 k-Connectivity
08:14
2.10.1 Trees
08:07
2.10.3 Tree Coloring
02:04
2.10.5 Spanning Trees
10:39
2.11.1 Stable Matching
11:20
2.11.2 Matching Ritual
09:18
2.11.5 Optimal Stable Matching
09:07
2.11.7 Bipartite Matching
04:02
2.11.9 Hall_s Theorem
15:31
3.1.1 Arithmetic Sums
03:59
3.1.3 Geometric Sums
10:36
3.1.5 Book Stacking
07:41
3.1.7 Integral Method
09:35
3.1.9 Stirling's Formula
05:51
3.2.1 Asymptotic Notation
07:43
3.2.3 Asymptotic Properties
10:12
3.2.6 Asymptotic Blunders
04:33
3.3.1 Sum And Product Rules
07:28
3.3.3 Counting with Bijections
11:43
3.4.1 Generalized Counting Rules
10:06
3.4.3 Two Pair Poker Hands
07:46
3.4.4 Binomial Theorem
05:42
3.4.5 Multinomial Theorem
07:51
3.5.1 The Pigeonhole Principle
04:14
3.5.3 Inclusion-Exclusion Example
13:10
3.5.4 Inclusion-Exclusion 2 Sets
07:10
4.1.1 Tree Model
25:25
4.1.3 Simplified Monty Hall Tree
07:41
4.1.5 Sample Spaces
09:47
4.2.1 Conditional Probability Definitions
12:19
4.2.3 Law of Total Probability
03:33
4.2.5 Bayes_ Theorem
11:39
4.2.7 Monty Hall Problem
08:42
4.3.1 Independence
03:37
4.3.3 Mutual Independence
08:20
4.4.1 Bigger Number Game
12:20
4.4.2 Random Variables： Independence
15:31
4.4.4 Random Variables： Uniform Binomial
11:33
4.5.1 Expectation
18:54
4.5.3 Expected Number Of Heads
04:40
4.5.5 Total Expectation
04:18
4.5.7 Mean Time to Failure
11:25
4.5.9 Linearity of Expectation
18:30
4.6.1 Deviation From The Mean
07:47
4.6.3 Markov Bounds
08:48
4.6.5 Chebyshev Bounds
10:23
4.6.7 Variance
14:36
4.7.1 Law Of Large Numbers
13:49
4.7.3 Independent Sampling Theorem
06:52
4.7.5 Birthday Matching
12:19
4.7.7 Sampling Confidence
12:57
4.8.1 Random Walks
10:35
4.8.2 Stationary Distributions
16:01
4.8.3 Page Rank
10:59
CS162《计算机操作系统》(2020)
1：什么是操作系统？
01:23:03
2：操作系统的四个基本概念
01:22:19
3：抽象 1：线程和进程
01:27:53
4：抽象 2：文件和 I⧸O 系统
01:28:16
5：抽象 3：IPC、管道和套接字
01:26:43
6：同步 1：并发和互斥
01:30:29
6.5：并发和互斥（补充内容）
47:30
7：同步 2：信号量（续）、锁的实现、原子指令
01:27:34
8：同步 3：原子指令（续）、监视器、读写锁
01:28:31
9：同步 4：监视器和读写锁（续）、进程结构
01:29:08
10：调度 1：概念和经典策略
01:28:06
11：调度 2：案例研究、实时性和前进性
01:27:21
12：调度 3：死锁
01:26:22
13：内存 1：地址转换和虚拟内存
01:28:42
14：内存 2：虚拟内存（续）、缓存和 TLBs
01:24:33
15：内存 3：缓存和 TLBs（续）、缓存替换
01:27:16
16：内存 4：分页策略
01:29:40
17：分页（完成）、通用 I⧸O、存储设备
01:24:31
18：通用 I⧸O（续）、存储设备、性能
01:27:45
19：文件系统 1：性能（续）、排队理论、文件系统设计
01:28:52
20：文件系统 2：文件系统设计（续）、文件系统案例研究
01:29:04
21：文件系统 3：案例研究（续）、缓冲区、可靠性和事务
01:26:51
22：事务（续）、端到端论点、分布式决策
01:27:13
23：分布式决策（续）、网络和 TCP⧸IP
01:27:07
24：网络和 TCP⧸IP（续）、RPC、分布式文件系统
01:28:50
25：分布式存储、NFS 和 AFS、键值存储
01:30:20
讲座 26（可选）：键值存储（续）、Chord、数据胶囊、量子计算
01:34:52
CS144《计算机网络》
Unit1-Internet-and-IP
02:19:09
Unit2-Transport
02:36:50
Unit3-Packet-Switching
03:35:25
Unit4-Congestion-Control
02:50:17
Unit5-Applications-and-NATs
02:40:30
Unit6-Routing
03:13:39
Unit7-Lower-Layers
03:55:23
Unit8-Security
02:53:26
CMU15-445《数据库系统导论》2024
#00 - Course Overview & Logistics
21:20
#01 - Relational Model & Algebra
01:23:38
#02 - Modern SQL
01:18:45
#03 - Database Storage： Files & Pages ✸ Neon Database Talk
01:22:28
#04 - Database Storage： Log-Structured Merge Trees & Tuples
01:22:41
#05 - Row vs. Column Storage + Compression ✸ StarTree Database Talk
01:28:00
#06 - Memory & Disk I⧸O Management
01:23:57
#07 - Hash Tables ✸ RelationalAI Database Talk
01:23:44
#08 - Tree Indexes： B+Trees
01:22:15
#09 - Vector Indexes Inverted Indexes Filters Tries ✸ TiDB Talk
01:21:11
#10 - Index Concurrency Control
01:16:42
#11 - Sorting & Aggregation Algorithms ✸ dbt Database Talk
01:17:57
#12 - Join Algorithms： Hash Sort-Merge Nested Loop Joins
01:14:23
#13 - Query Execution Part 1
01:23:19
#14 - Query Execution Part 2 ✸ ClickHouse Database Talk
01:02:50
#15 - Query Planning & Optimization
01:21:18
#16 - Concurrency Control Theory ✸ Firebolt Database Talk
01:27:09
#17 - Two-Phase Locking Concurrency Control
01:05:22
#18 - Optimistic Concurrency Control ✸ Weaviate Database Talk
01:20:53
#19 - Multi-Version Concurrency Control
01:27:07
#20 - Database Logging ✸ Confluent Database Talk
01:19:21
#21 - Database Recovery with ARIES
01:12:55
#22 - Distributed Database Architectures ✸ DataStax Database Talk
01:23:02
#23 - Distributed Transactional Databases
01:24:54
#24 - Distributed Analytical Databases
01:22:56
#25 - BigQuery + Snowflake + Redshift + Databricks + DuckDB
01:25:58
CS143《编译原理》
1.Course Overview
42:04
2.Cool: The Course Project
53:08
3.Lexical Analysis
01:03:46
4.Implementation of Lexical Analysis
01:14:51
5.Introduction to Parsing
44:52
6.Syntax-Directed Translation
57:30
7.Top-Down Parsing
01:20:29
8.Bottom-Up Parsing
01:24:03
9.Semantic Analysis & Type Checking I
01:21:30
10.Type Checking II
50:40
11.Run-time Environments
01:03:09
12.Code Generation
01:37:00
13.Operational Semantics
01:06:50
14.Intermediate Code & Local Optimization
52:45
15.Global Optimization
56:49
16.Register Allocation
47:30
17.Automatic Memory Management
01:05:57
18.To be announced
01:19:18
MIT6.824《分布式系统》(2021)
Lecture 1 - Introduction
01:19:09
Lecture 2： RPC and Threads
01:07:07
Lecture 3： GFS
01:06:18
Lecture 4： Primary-Backup Replication
01:33:00
Lecture 5： Fault Tolerance： Raft (1)
01:39:23
Lecture 6 - Lab 1 Q&A
01:26:35
Lecture 7 - Fault Tolerance - Raft (2)
01:48:46
Lecture 8 - Lab 2A_2B Q&A
01:33:01
Lecture 9 - Zookeeper
01:22:51
Lecture 10 - Guest Lecture on Go - Russ Cox
01:35:27
Lecture 11 - Chain Replication
01:34:20
Lecture 12 - Cache Consistency - Frangipani
01:27:59
Lecture 13 - Distributed Transactions
01:21:29
Lecture 14 - Spanner
01:37:09
Lecture 15：Optimistic Concurrency Control (FaRM)
01:34:38
Lecture 15 continued - Optimistic Concurrency Control (FaRM) pt. 2
27:57
Lecture 16 - Big Data - Spark
01:18:49
Lecture 17 - Cache Consistency - Memcached at Facebook
01:44:16
Lecture 18 - Fork Consistency SUNDR
01:31:05
Lecture 19 - Peer-to-Peeer - Bitcoin
01:22:44
Lecture 20 - Blockstack
01:29:44
Lecture 21 - Project Presentations
01:38:00
展开