本站已收录 番号和无损神作磁力链接/BT种子 

uc-berkeley-cs61a-sicp

种子简介

种子名称: uc-berkeley-cs61a-sicp
文件类型: 视频
文件数目: 215个文件
文件大小: 2.75 GB
收录时间: 2021-4-25 07:38
已经下载: 3
资源热度: 124
最近下载: 2024-7-1 22:15

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:8768e72ad733f6bb4ff7cb6f1ce318d62d879368&dn=uc-berkeley-cs61a-sicp 复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

uc-berkeley-cs61a-sicp.torrent
  • uc-berkeley-cs61a-sicp/01/01-about.mp429.85MB
  • uc-berkeley-cs61a-sicp/01/02-introduction.mp47.37MB
  • uc-berkeley-cs61a-sicp/01/03-alternatives-to-this-course.mp413.6MB
  • uc-berkeley-cs61a-sicp/01/04-course-policies.mp47.2MB
  • uc-berkeley-cs61a-sicp/01/05-expressions.mp424.43MB
  • uc-berkeley-cs61a-sicp/01/06-functions-objects-interpreters.mp49.82MB
  • uc-berkeley-cs61a-sicp/01/07-newtons-method.mp417.52MB
  • uc-berkeley-cs61a-sicp/01/08-iterative-improvement.mp458.36MB
  • uc-berkeley-cs61a-sicp/01/09-implementing-newtons-method.mp46.91MB
  • uc-berkeley-cs61a-sicp/01/10-extensions-of-newtons-method.mp421.23MB
  • uc-berkeley-cs61a-sicp/02/1-announcements.mp417.03MB
  • uc-berkeley-cs61a-sicp/02/2-names-assignment-user-defined-functions.mp416.49MB
  • uc-berkeley-cs61a-sicp/02/3-environment-diagrams.mp451.24MB
  • uc-berkeley-cs61a-sicp/02/4-defining-functions.mp477.79MB
  • uc-berkeley-cs61a-sicp/03/1-announcements.mp48.93MB
  • uc-berkeley-cs61a-sicp/03/2-print-and-none.mp48.2MB
  • uc-berkeley-cs61a-sicp/03/3-multiple-environments.mp411.69MB
  • uc-berkeley-cs61a-sicp/03/4-miscellaneous-python-features.mp416.01MB
  • uc-berkeley-cs61a-sicp/03/5-conditional-statements.mp48.3MB
  • uc-berkeley-cs61a-sicp/03/6-iteration.mp45.47MB
  • uc-berkeley-cs61a-sicp/04/1-announcements.mp48.91MB
  • uc-berkeley-cs61a-sicp/04/2-iteration-example.mp418.07MB
  • uc-berkeley-cs61a-sicp/04/3-designing-functions.mp44.26MB
  • uc-berkeley-cs61a-sicp/04/4-higher-order-functions.mp417MB
  • uc-berkeley-cs61a-sicp/04/5-pi.mp47.89MB
  • uc-berkeley-cs61a-sicp/05/1-announcements.mp44.58MB
  • uc-berkeley-cs61a-sicp/05/2-environments-for-higher-order-functions.mp47.96MB
  • uc-berkeley-cs61a-sicp/05/3-example.mp47.1MB
  • uc-berkeley-cs61a-sicp/05/4-environments-for-nested-definitons.mp413.05MB
  • uc-berkeley-cs61a-sicp/05/5-local-names.mp43.22MB
  • uc-berkeley-cs61a-sicp/05/6-function-composition.mp46.06MB
  • uc-berkeley-cs61a-sicp/05/7-lambda-expressions.mp410.17MB
  • uc-berkeley-cs61a-sicp/06/1-announcements.mp418.27MB
  • uc-berkeley-cs61a-sicp/06/2-recursive-functions.mp412.23MB
  • uc-berkeley-cs61a-sicp/06/3-recursion-in-environment-diagrams.mp418.98MB
  • uc-berkeley-cs61a-sicp/06/4-verifying-recursive-functions.mp44.85MB
  • uc-berkeley-cs61a-sicp/06/5-mutual-recursion.mp47.41MB
  • uc-berkeley-cs61a-sicp/06/6-recursion-and-iteration.mp46.45MB
  • uc-berkeley-cs61a-sicp/07/1-announcements.mp422.5MB
  • uc-berkeley-cs61a-sicp/07/2-order-of-recursive-functions.mp49.15MB
  • uc-berkeley-cs61a-sicp/07/3-example-inverse-cascade.mp42.91MB
  • uc-berkeley-cs61a-sicp/07/4-tree-recursion.mp414.07MB
  • uc-berkeley-cs61a-sicp/07/5-example-counting-partitions.mp416.02MB
  • uc-berkeley-cs61a-sicp/08/1-announcements.mp44.14MB
  • uc-berkeley-cs61a-sicp/08/2-abstractions.mp48.99MB
  • uc-berkeley-cs61a-sicp/08/3-testing.mp414.9MB
  • uc-berkeley-cs61a-sicp/08/4-currying.mp43.86MB
  • uc-berkeley-cs61a-sicp/08/5-decorators.mp45.82MB
  • uc-berkeley-cs61a-sicp/08/6-review.mp432.52MB
  • uc-berkeley-cs61a-sicp/09/1-announcements.mp41.57MB
  • uc-berkeley-cs61a-sicp/09/2-data-abstraction.mp47.47MB
  • uc-berkeley-cs61a-sicp/09/3-pairs.mp48.58MB
  • uc-berkeley-cs61a-sicp/09/4-abstraction-barriers.mp410.93MB
  • uc-berkeley-cs61a-sicp/09/5-data-representations.mp417.78MB
  • uc-berkeley-cs61a-sicp/10/1-announcements.mp49.17MB
  • uc-berkeley-cs61a-sicp/10/2-lists.mp47MB
  • uc-berkeley-cs61a-sicp/10/3-containers.mp44.36MB
  • uc-berkeley-cs61a-sicp/10/4-for-statements.mp47.54MB
  • uc-berkeley-cs61a-sicp/10/5-ranges.mp46.37MB
  • uc-berkeley-cs61a-sicp/10/6-list-comprehensions.mp43.99MB
  • uc-berkeley-cs61a-sicp/10/6-strings.mp45.38MB
  • uc-berkeley-cs61a-sicp/10/7-dictionaries.mp410.39MB
  • uc-berkeley-cs61a-sicp/11/1-announcements.mp49.46MB
  • uc-berkeley-cs61a-sicp/11/2-maps-project-introduction.mp415.3MB
  • uc-berkeley-cs61a-sicp/11/3-box-and-pointer-notation.mp47.87MB
  • uc-berkeley-cs61a-sicp/11/4-slicing.mp45.58MB
  • uc-berkeley-cs61a-sicp/11/5-processing-container-values.mp414.23MB
  • uc-berkeley-cs61a-sicp/11/6-trees.mp425.19MB
  • uc-berkeley-cs61a-sicp/11/7-tree-processing.mp417.62MB
  • uc-berkeley-cs61a-sicp/11/8-example-printing-trees.mp48.14MB
  • uc-berkeley-cs61a-sicp/12/1-announcements.mp411.32MB
  • uc-berkeley-cs61a-sicp/12/2-objects.mp416.7MB
  • uc-berkeley-cs61a-sicp/12/3-example-strings.mp420.28MB
  • uc-berkeley-cs61a-sicp/12/4-mutation-operations.mp414.99MB
  • uc-berkeley-cs61a-sicp/12/5-tuples.mp49.55MB
  • uc-berkeley-cs61a-sicp/12/6-mutation.mp412.09MB
  • uc-berkeley-cs61a-sicp/13/1-announcements.mp43.07MB
  • uc-berkeley-cs61a-sicp/13/2-measuring-efficiency.mp410.02MB
  • uc-berkeley-cs61a-sicp/13/3-memoization.mp413.79MB
  • uc-berkeley-cs61a-sicp/13/4-space.mp416.62MB
  • uc-berkeley-cs61a-sicp/13/5-time.mp412.37MB
  • uc-berkeley-cs61a-sicp/13/6-orders-of-growth.mp421.01MB
  • uc-berkeley-cs61a-sicp/13/7-exponentiation.mp412.16MB
  • uc-berkeley-cs61a-sicp/13/8-comparing-orders-of-growth.mp412.65MB
  • uc-berkeley-cs61a-sicp/14/1-announcements.mp410.01MB
  • uc-berkeley-cs61a-sicp/14/2-mutable-functions.mp421.33MB
  • uc-berkeley-cs61a-sicp/14/3-non-local-assignment.mp418MB
  • uc-berkeley-cs61a-sicp/14/4-multiple-mutable-functions.mp412.12MB
  • uc-berkeley-cs61a-sicp/15/1-announcements.mp43.19MB
  • uc-berkeley-cs61a-sicp/15/2-object-oriented-programming.mp49.94MB
  • uc-berkeley-cs61a-sicp/15/3-class-statements.mp412.27MB
  • uc-berkeley-cs61a-sicp/15/4-methods.mp415.26MB
  • uc-berkeley-cs61a-sicp/15/5-attributes.mp439.93MB
  • uc-berkeley-cs61a-sicp/16/1-announcements.mp43.02MB
  • uc-berkeley-cs61a-sicp/16/2-attributes.mp44.95MB
  • uc-berkeley-cs61a-sicp/16/3-attribute-assignment.mp412.28MB
  • uc-berkeley-cs61a-sicp/16/4-inheritance.mp419.72MB
  • uc-berkeley-cs61a-sicp/16/5-object-oriented-design.mp416.44MB
  • uc-berkeley-cs61a-sicp/16/6-multiple-inheritance.mp45.23MB
  • uc-berkeley-cs61a-sicp/16/7-complicated-inheritance.mp44.12MB
  • uc-berkeley-cs61a-sicp/17/1-announcements.mp45.81MB
  • uc-berkeley-cs61a-sicp/17/2-string-representations.mp416.98MB
  • uc-berkeley-cs61a-sicp/17/3-polymorphic-functions.mp426.41MB
  • uc-berkeley-cs61a-sicp/17/4-special-method-names.mp422.79MB
  • uc-berkeley-cs61a-sicp/18/1-announcements.mp415.18MB
  • uc-berkeley-cs61a-sicp/18/2-ok-collab-editor-demo.mp49.41MB
  • uc-berkeley-cs61a-sicp/18/3-sequences.mp43.2MB
  • uc-berkeley-cs61a-sicp/18/4-linked-lists.mp419.76MB
  • uc-berkeley-cs61a-sicp/18/5-sequence-operations.mp415.09MB
  • uc-berkeley-cs61a-sicp/18/6-property-methods.mp49.57MB
  • uc-berkeley-cs61a-sicp/18/7-linked-list-processing.mp433.2MB
  • uc-berkeley-cs61a-sicp/19/1-announcements.mp44.64MB
  • uc-berkeley-cs61a-sicp/19/2-tree-class.mp430.43MB
  • uc-berkeley-cs61a-sicp/19/3-tree-mutation.mp410.37MB
  • uc-berkeley-cs61a-sicp/19/4-hailstone-trees.mp435.33MB
  • uc-berkeley-cs61a-sicp/20/1-announcements.mp46.09MB
  • uc-berkeley-cs61a-sicp/20/2-sets.mp48.79MB
  • uc-berkeley-cs61a-sicp/20/3-sets-as-linked-lists.mp415.55MB
  • uc-berkeley-cs61a-sicp/20/4-sets-as-ordered-linked-lists.mp417.02MB
  • uc-berkeley-cs61a-sicp/20/5-set-operations.mp410.26MB
  • uc-berkeley-cs61a-sicp/20/6-set-mutation.mp411.86MB
  • uc-berkeley-cs61a-sicp/21/1-announcements.mp41.54KB
  • uc-berkeley-cs61a-sicp/21/2-binary-trees.mp412.78MB
  • uc-berkeley-cs61a-sicp/21/3-binary-search-trees.mp415.93MB
  • uc-berkeley-cs61a-sicp/21/4-sets-as-binary-search-trees.mp415.47MB
  • uc-berkeley-cs61a-sicp/22/1-announcements.mp46MB
  • uc-berkeley-cs61a-sicp/22/2-mutable-linked-lists.mp46.63MB
  • uc-berkeley-cs61a-sicp/22/3-environment-diagrams.mp411.44MB
  • uc-berkeley-cs61a-sicp/22/4-objects.mp419.44MB
  • uc-berkeley-cs61a-sicp/22/5-trees.mp429.51MB
  • uc-berkeley-cs61a-sicp/24/1-announcements.mp42.7MB
  • uc-berkeley-cs61a-sicp/24/2-scheme.mp415MB
  • uc-berkeley-cs61a-sicp/24/3-special-forms.mp47.07MB
  • uc-berkeley-cs61a-sicp/24/4-scheme-interpreters.mp41.69MB
  • uc-berkeley-cs61a-sicp/24/5-lambda-expressions.mp42.06MB
  • uc-berkeley-cs61a-sicp/24/6-pairs-and-lists.mp430.06MB
  • uc-berkeley-cs61a-sicp/24/7-symbolic-programming.mp46.62MB
  • uc-berkeley-cs61a-sicp/25/1-announcements.mp44.25MB
  • uc-berkeley-cs61a-sicp/25/2-exceptions.mp49.59MB
  • uc-berkeley-cs61a-sicp/25/3-raising-exceptions.mp47.33MB
  • uc-berkeley-cs61a-sicp/25/4-try-statements.mp415.14MB
  • uc-berkeley-cs61a-sicp/25/5-example-reduce.mp48.83MB
  • uc-berkeley-cs61a-sicp/25/6-sierpinskis-traingle.mp48.23MB
  • uc-berkeley-cs61a-sicp/26/1-announcements.mp416.33MB
  • uc-berkeley-cs61a-sicp/26/2-interpreters.mp412.69MB
  • uc-berkeley-cs61a-sicp/26/3-parsing.mp410.77MB
  • uc-berkeley-cs61a-sicp/26/4-calculator.mp415.35MB
  • uc-berkeley-cs61a-sicp/26/5-evaluation.mp414.01MB
  • uc-berkeley-cs61a-sicp/26/6-interactive-interpreter.mp414.97MB
  • uc-berkeley-cs61a-sicp/27/1-announcements.mp45.81MB
  • uc-berkeley-cs61a-sicp/27/2-interpreting-scheme.mp44.37MB
  • uc-berkeley-cs61a-sicp/27/3-special-forms.mp418.94MB
  • uc-berkeley-cs61a-sicp/27/4-logical-forms.mp45.27MB
  • uc-berkeley-cs61a-sicp/27/5-quotation.mp42.87MB
  • uc-berkeley-cs61a-sicp/27/6-lambda-expressions.mp44.05MB
  • uc-berkeley-cs61a-sicp/27/7-define-expressions.mp46.28MB
  • uc-berkeley-cs61a-sicp/28/1-announcements.mp48.74MB
  • uc-berkeley-cs61a-sicp/28/2-dynamic-scope.mp43.04MB
  • uc-berkeley-cs61a-sicp/28/3-tail-recursion.mp411.64MB
  • uc-berkeley-cs61a-sicp/28/4-tail-calls.mp481.63MB
  • uc-berkeley-cs61a-sicp/28/5-tail-recursion-examples.mp46.61MB
  • uc-berkeley-cs61a-sicp/28/6-map-and-reduce.mp48.02MB
  • uc-berkeley-cs61a-sicp/28/7-general-computing-machines.mp43.18MB
  • uc-berkeley-cs61a-sicp/29/1-announcements.mp42.94MB
  • uc-berkeley-cs61a-sicp/29/2-data-processing.mp48.87MB
  • uc-berkeley-cs61a-sicp/29/3-iterators.mp419.47MB
  • uc-berkeley-cs61a-sicp/29/4-for-statements.mp414.32MB
  • uc-berkeley-cs61a-sicp/29/5-builtin-iterator-functions.mp419.68MB
  • uc-berkeley-cs61a-sicp/29/6-generators.mp414.28MB
  • uc-berkeley-cs61a-sicp/29/7-generators-and-iterators.mp412.29MB
  • uc-berkeley-cs61a-sicp/30/1-announcements.mp46.27MB
  • uc-berkeley-cs61a-sicp/30/2-efficient-sequence-processing.mp422.31MB
  • uc-berkeley-cs61a-sicp/30/3-streams.mp418MB
  • uc-berkeley-cs61a-sicp/30/4-infinite-streams.mp45.35MB
  • uc-berkeley-cs61a-sicp/30/5-stream-processing.mp411.35MB
  • uc-berkeley-cs61a-sicp/30/6-higher-order-functions.mp410.38MB
  • uc-berkeley-cs61a-sicp/31/1-announcements.mp410.93MB
  • uc-berkeley-cs61a-sicp/31/2-declarative-languages.mp413.94MB
  • uc-berkeley-cs61a-sicp/31/3-structured-query-language.mp49.87MB
  • uc-berkeley-cs61a-sicp/31/4-projecting-tables.mp45.96MB
  • uc-berkeley-cs61a-sicp/31/6-arithmetic.mp421.28MB
  • uc-berkeley-cs61a-sicp/32/1-announcements.mp42.64MB
  • uc-berkeley-cs61a-sicp/32/2-joining-tables.mp414.71MB
  • uc-berkeley-cs61a-sicp/32/3-aliases-and-dot-expressions.mp411.49MB
  • uc-berkeley-cs61a-sicp/32/4-numerical-expressions.mp412.48MB
  • uc-berkeley-cs61a-sicp/32/5-string-expressions.mp412.46MB
  • uc-berkeley-cs61a-sicp/33/1-announcements.mp42.06MB
  • uc-berkeley-cs61a-sicp/33/2-database-management-systems.mp418.88MB
  • uc-berkeley-cs61a-sicp/33/3-local-tables.mp49.62MB
  • uc-berkeley-cs61a-sicp/33/4-recursive-local-tables.mp412.91MB
  • uc-berkeley-cs61a-sicp/33/5-string-examples.mp48.35MB
  • uc-berkeley-cs61a-sicp/33/6-integer-examples.mp416.5MB
  • uc-berkeley-cs61a-sicp/34/1-announcements.mp43.86MB
  • uc-berkeley-cs61a-sicp/34/2-aggregration.mp424.58MB
  • uc-berkeley-cs61a-sicp/34/3-groups.mp416.95MB
  • uc-berkeley-cs61a-sicp/34/4-select-grammar.mp410.47MB
  • uc-berkeley-cs61a-sicp/35/1-announcements.mp42.34MB
  • uc-berkeley-cs61a-sicp/35/2-distributed-computing.mp48.84MB
  • uc-berkeley-cs61a-sicp/35/3-internet-protocol.mp411.61MB
  • uc-berkeley-cs61a-sicp/35/4-transmission-control-protocol.mp49.2MB
  • uc-berkeley-cs61a-sicp/35/5-client-server-architecture.mp47.43MB
  • uc-berkeley-cs61a-sicp/35/6-peer-to-peer-architecture.mp413.91MB
  • uc-berkeley-cs61a-sicp/36/1-announcements.mp44.79MB
  • uc-berkeley-cs61a-sicp/36/2-unix.mp424.62MB
  • uc-berkeley-cs61a-sicp/36/3-big-data.mp47.91MB
  • uc-berkeley-cs61a-sicp/36/4-apache-spark.mp425.6MB
  • uc-berkeley-cs61a-sicp/36/5-map-reduce.mp422.33MB
  • uc-berkeley-cs61a-sicp/37/1-announcements.mp43.76MB
  • uc-berkeley-cs61a-sicp/37/2-ambiguity.mp45.4MB
  • uc-berkeley-cs61a-sicp/37/3-syntax-trees.mp45.69MB
  • uc-berkeley-cs61a-sicp/37/4-grammars.mp420.78MB
  • uc-berkeley-cs61a-sicp/37/5-parsing.mp420.97MB
  • uc-berkeley-cs61a-sicp/37/6-learning.mp418.22MB
  • uc-berkeley-cs61a-sicp/37/7-translation.mp413.11MB
  • uc-berkeley-cs61a-sicp/38/1-announcements.mp442.88MB