uc-berkeley-cs61a-sicp/01/01-about.mp4 | 31.31MB |
uc-berkeley-cs61a-sicp/01/02-introduction.mp4 | 7.73MB |
uc-berkeley-cs61a-sicp/01/03-alternatives-to-this-course.mp4 | 14.26MB |
uc-berkeley-cs61a-sicp/01/04-course-policies.mp4 | 7.55MB |
uc-berkeley-cs61a-sicp/01/05-expressions.mp4 | 25.62MB |
uc-berkeley-cs61a-sicp/01/06-functions-objects-interpreters.mp4 | 10.30MB |
uc-berkeley-cs61a-sicp/01/07-newtons-method.mp4 | 18.37MB |
uc-berkeley-cs61a-sicp/01/08-iterative-improvement.mp4 | 61.20MB |
uc-berkeley-cs61a-sicp/01/09-implementing-newtons-method.mp4 | 7.25MB |
uc-berkeley-cs61a-sicp/01/10-extensions-of-newtons-method.mp4 | 22.27MB |
uc-berkeley-cs61a-sicp/02/1-announcements.mp4 | 17.85MB |
uc-berkeley-cs61a-sicp/02/2-names-assignment-user-defined-functions.mp4 | 17.29MB |
uc-berkeley-cs61a-sicp/02/3-environment-diagrams.mp4 | 53.73MB |
uc-berkeley-cs61a-sicp/02/4-defining-functions.mp4 | 81.56MB |
uc-berkeley-cs61a-sicp/03/1-announcements.mp4 | 9.36MB |
uc-berkeley-cs61a-sicp/03/2-print-and-none.mp4 | 8.60MB |
uc-berkeley-cs61a-sicp/03/3-multiple-environments.mp4 | 12.26MB |
uc-berkeley-cs61a-sicp/03/4-miscellaneous-python-features.mp4 | 16.78MB |
uc-berkeley-cs61a-sicp/03/5-conditional-statements.mp4 | 8.71MB |
uc-berkeley-cs61a-sicp/03/6-iteration.mp4 | 5.74MB |
uc-berkeley-cs61a-sicp/04/1-announcements.mp4 | 9.35MB |
uc-berkeley-cs61a-sicp/04/2-iteration-example.mp4 | 18.95MB |
uc-berkeley-cs61a-sicp/04/3-designing-functions.mp4 | 4.47MB |
uc-berkeley-cs61a-sicp/04/4-higher-order-functions.mp4 | 17.82MB |
uc-berkeley-cs61a-sicp/04/5-pi.mp4 | 8.27MB |
uc-berkeley-cs61a-sicp/05/1-announcements.mp4 | 4.81MB |
uc-berkeley-cs61a-sicp/05/2-environments-for-higher-order-functions.mp4 | 8.34MB |
uc-berkeley-cs61a-sicp/05/3-example.mp4 | 7.44MB |
uc-berkeley-cs61a-sicp/05/4-environments-for-nested-definitons.mp4 | 13.68MB |
uc-berkeley-cs61a-sicp/05/5-local-names.mp4 | 3.37MB |
uc-berkeley-cs61a-sicp/05/6-function-composition.mp4 | 6.36MB |
uc-berkeley-cs61a-sicp/05/7-lambda-expressions.mp4 | 10.66MB |
uc-berkeley-cs61a-sicp/06/1-announcements.mp4 | 19.16MB |
uc-berkeley-cs61a-sicp/06/2-recursive-functions.mp4 | 12.82MB |
uc-berkeley-cs61a-sicp/06/3-recursion-in-environment-diagrams.mp4 | 19.90MB |
uc-berkeley-cs61a-sicp/06/4-verifying-recursive-functions.mp4 | 5.08MB |
uc-berkeley-cs61a-sicp/06/5-mutual-recursion.mp4 | 7.77MB |
uc-berkeley-cs61a-sicp/06/6-recursion-and-iteration.mp4 | 6.76MB |
uc-berkeley-cs61a-sicp/07/1-announcements.mp4 | 23.60MB |
uc-berkeley-cs61a-sicp/07/2-order-of-recursive-functions.mp4 | 9.60MB |
uc-berkeley-cs61a-sicp/07/3-example-inverse-cascade.mp4 | 3.05MB |
uc-berkeley-cs61a-sicp/07/4-tree-recursion.mp4 | 14.76MB |
uc-berkeley-cs61a-sicp/07/5-example-counting-partitions.mp4 | 16.80MB |
uc-berkeley-cs61a-sicp/08/1-announcements.mp4 | 4.34MB |
uc-berkeley-cs61a-sicp/08/2-abstractions.mp4 | 9.42MB |
uc-berkeley-cs61a-sicp/08/3-testing.mp4 | 15.62MB |
uc-berkeley-cs61a-sicp/08/4-currying.mp4 | 4.05MB |
uc-berkeley-cs61a-sicp/08/5-decorators.mp4 | 6.10MB |
uc-berkeley-cs61a-sicp/08/6-review.mp4 | 34.10MB |
uc-berkeley-cs61a-sicp/09/1-announcements.mp4 | 1.65MB |
uc-berkeley-cs61a-sicp/09/2-data-abstraction.mp4 | 7.83MB |
uc-berkeley-cs61a-sicp/09/3-pairs.mp4 | 9.00MB |
uc-berkeley-cs61a-sicp/09/4-abstraction-barriers.mp4 | 11.46MB |
uc-berkeley-cs61a-sicp/09/5-data-representations.mp4 | 18.64MB |
uc-berkeley-cs61a-sicp/10/1-announcements.mp4 | 9.61MB |
uc-berkeley-cs61a-sicp/10/2-lists.mp4 | 7.34MB |
uc-berkeley-cs61a-sicp/10/3-containers.mp4 | 4.57MB |
uc-berkeley-cs61a-sicp/10/4-for-statements.mp4 | 7.91MB |
uc-berkeley-cs61a-sicp/10/5-ranges.mp4 | 6.68MB |
uc-berkeley-cs61a-sicp/10/6-list-comprehensions.mp4 | 4.18MB |
uc-berkeley-cs61a-sicp/10/6-strings.mp4 | 5.64MB |
uc-berkeley-cs61a-sicp/10/7-dictionaries.mp4 | 10.89MB |
uc-berkeley-cs61a-sicp/11/1-announcements.mp4 | 9.92MB |
uc-berkeley-cs61a-sicp/11/2-maps-project-introduction.mp4 | 16.04MB |
uc-berkeley-cs61a-sicp/11/3-box-and-pointer-notation.mp4 | 8.25MB |
uc-berkeley-cs61a-sicp/11/4-slicing.mp4 | 5.85MB |
uc-berkeley-cs61a-sicp/11/5-processing-container-values.mp4 | 14.92MB |
uc-berkeley-cs61a-sicp/11/6-trees.mp4 | 26.41MB |
uc-berkeley-cs61a-sicp/11/7-tree-processing.mp4 | 18.47MB |
uc-berkeley-cs61a-sicp/11/8-example-printing-trees.mp4 | 8.53MB |
uc-berkeley-cs61a-sicp/12/1-announcements.mp4 | 11.87MB |
uc-berkeley-cs61a-sicp/12/2-objects.mp4 | 17.51MB |
uc-berkeley-cs61a-sicp/12/3-example-strings.mp4 | 21.26MB |
uc-berkeley-cs61a-sicp/12/4-mutation-operations.mp4 | 15.72MB |
uc-berkeley-cs61a-sicp/12/5-tuples.mp4 | 10.01MB |
uc-berkeley-cs61a-sicp/12/6-mutation.mp4 | 12.67MB |
uc-berkeley-cs61a-sicp/13/1-announcements.mp4 | 3.22MB |
uc-berkeley-cs61a-sicp/13/2-measuring-efficiency.mp4 | 10.50MB |
uc-berkeley-cs61a-sicp/13/3-memoization.mp4 | 14.46MB |
uc-berkeley-cs61a-sicp/13/4-space.mp4 | 17.43MB |
uc-berkeley-cs61a-sicp/13/5-time.mp4 | 12.97MB |
uc-berkeley-cs61a-sicp/13/6-orders-of-growth.mp4 | 22.04MB |
uc-berkeley-cs61a-sicp/13/7-exponentiation.mp4 | 12.75MB |
uc-berkeley-cs61a-sicp/13/8-comparing-orders-of-growth.mp4 | 13.27MB |
uc-berkeley-cs61a-sicp/14/1-announcements.mp4 | 10.49MB |
uc-berkeley-cs61a-sicp/14/2-mutable-functions.mp4 | 22.36MB |
uc-berkeley-cs61a-sicp/14/3-non-local-assignment.mp4 | 18.87MB |
uc-berkeley-cs61a-sicp/14/4-multiple-mutable-functions.mp4 | 12.71MB |
uc-berkeley-cs61a-sicp/15/1-announcements.mp4 | 3.34MB |
uc-berkeley-cs61a-sicp/15/2-object-oriented-programming.mp4 | 10.43MB |
uc-berkeley-cs61a-sicp/15/3-class-statements.mp4 | 12.87MB |
uc-berkeley-cs61a-sicp/15/4-methods.mp4 | 16.00MB |
uc-berkeley-cs61a-sicp/15/5-attributes.mp4 | 41.87MB |
uc-berkeley-cs61a-sicp/16/1-announcements.mp4 | 3.17MB |
uc-berkeley-cs61a-sicp/16/2-attributes.mp4 | 5.19MB |
uc-berkeley-cs61a-sicp/16/3-attribute-assignment.mp4 | 12.88MB |
uc-berkeley-cs61a-sicp/16/4-inheritance.mp4 | 20.68MB |
uc-berkeley-cs61a-sicp/16/5-object-oriented-design.mp4 | 17.24MB |
uc-berkeley-cs61a-sicp/16/6-multiple-inheritance.mp4 | 5.48MB |
uc-berkeley-cs61a-sicp/16/7-complicated-inheritance.mp4 | 4.32MB |
Too many files! Click here to view them all. |