[CourseClub.Me] Coursera - Data Science Foundations Data Structures and Algorithms Specialization

磁力链接/BT种子名称

[CourseClub.Me] Coursera - Data Science Foundations Data Structures and Algorithms Specialization

磁力链接/BT种子简介

种子哈希：381eadac2c3c401aedad5b78e37babd63ab769d9
文件大小： 5.58G
已经下载：484次
下载速度：极快
收录时间：2024-01-13
最近下载：2025-07-14

移花宫入口

移花宫.com邀月.com怜星.com花无缺.comyhgbt.icuyhgbt.top

磁力链接下载

magnet:?xt=urn:btih:381EADAC2C3C401AEDAD5B78E37BABD63AB769D9
推荐使用PIKPAK网盘下载资源，10TB超大空间，不限制资源，无限次数离线下载，视频在线观看

下载BT种子文件

磁力链接 迅雷下载 PIKPAK在线播放 世界之窗 91视频 含羞草 欲漫涩 逼哩逼哩 成人快手 51品茶 抖阴破解版 极乐禁地 91短视频 她趣 TikTok成人版 PornHub 听泉鉴鲍 草榴社区 哆哔涩漫 呦乐园 萝莉岛

最近搜索

文件列表

  • 2. Trees and Graphs Basics/Week 2/3. Depth First Search.mp4 218.0 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/3. Karatsuba’s Multiplication Algorithm.mp4 189.7 MB
  • 1/Week 1/2. An Introduction Through the Insertion Sort Algorithm.mp4 178.2 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/4. Knapsack Problem.mp4 176.6 MB
  • 1/Week 1/4. Asymptotic Notation.mp4 171.2 MB
  • 1/Week 1/3. Time and Space Complexity.mp4 171.2 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/1. Introduction to Dynamic Programming + Rod Cutting Problem.mp4 168.5 MB
  • 1/Week 3/4. Analysis of Quicksort Algorithm.mp4 168.1 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/3. Prefix Codes.mp4 165.4 MB
  • 2. Trees and Graphs Basics/Week 1/2. Binary Search Trees -- Insertion and Deletion.mp4 161.4 MB
  • 2. Trees and Graphs Basics/Week 3/3. Spanning Trees and Minimal Spanning Trees with Applications.mp4 157.0 MB
  • 1/Week 1/1. What is an Algorithm.mp4 152.6 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/6. Dynamic Programming Longest Common Subsequence.mp4 146.3 MB
  • 1/Week 3/3. Detailed Design of Partitioning Schemes.mp4 143.5 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/2. Rod Cutting Problem Memoization.mp4 134.0 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/2. Max Subarray Problem Using Divide and Conquer.mp4 130.8 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/2. Greedy Interval Scheduling.mp4 130.4 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/1. Introduction to Greedy Algorithms.mp4 109.8 MB
  • 2. Trees and Graphs Basics/Week 1/1. Binary Search Trees -- Introduction and Properties.mp4 108.7 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/5. Huffman Codes Proof of Optimality.mp4 104.1 MB
  • 1/Week 3/7. Universal Hash Functions and Analysis.mp4 102.0 MB
  • 1/Week 3/5. Quickselect Algorithm and its Applications.mp4 101.1 MB
  • 2. Trees and Graphs Basics/Week 2/6. Strongly Connected Components - Properties.mp4 97.2 MB
  • 2. Trees and Graphs Basics/Week 2/7. Strongly Connected Components - Algorithm.mp4 95.6 MB
  • 2. Trees and Graphs Basics/Week 2/5. Strongly Connected Components - Definitions.mp4 90.1 MB
  • 1/Week 1/7. Pitfalls and Logarithms.mp4 88.5 MB
  • 2. Trees and Graphs Basics/Week 2/2. Graph Traversals and Breadth First Traversal.mp4 86.8 MB
  • 2. Trees and Graphs Basics/Week 4/2. Bellman-Ford Algorithm for Single Source Shortest Paths.mp4 78.8 MB
  • 1/Week 3/2. Partition and Quicksort Algorithm.mp4 78.3 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/5. FFT Part 1 Introduction and Complex Numbers.mp4 74.1 MB
  • 2. Trees and Graphs Basics/Week 2/1. Graphs and Their Representations.mp4 69.1 MB
  • 2. Trees and Graphs Basics/Week 2/4. Topological Sorting and Applications.mp4 67.8 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/9. Grover's Search Algorithm.mp4 67.1 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/4. NP Completeness and Reductions.mp4 67.0 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/3. Coin Changing Problem.mp4 66.7 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/1. Decision Problems and Languages.mp4 60.7 MB
  • 2. Trees and Graphs Basics/Week 3/5. Union-Find Data Structures and Rank Compression.mp4 59.1 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/7. Qubits and Operations.mp4 57.9 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/5. When Optimal Substructure Fails.mp4 57.3 MB
  • 2. Trees and Graphs Basics/Week 4/6. All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm.mp4 56.0 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/6. FFT Part 2 Definition and Interpretation of Discrete Fourier Transforms.mp4 53.3 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/4. Huffman Codes.mp4 51.9 MB
  • 2. Trees and Graphs Basics/Week 1/3. Red-Black Trees Basics.mp4 50.9 MB
  • 1/Week 4/2. Perfect hashing and Cuckoo hashing.mp4 50.7 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/3. NP Definition.mp4 50.0 MB
  • 2. Trees and Graphs Basics/Week 3/4. Kruskal’s Algorithm for Finding Minimal Spanning Trees.mp4 49.0 MB
  • 2. Trees and Graphs Basics/Week 1/5. Skip Lists.mp4 48.0 MB
  • 1/Week 1/6. Merge Sort Algorithm, Analysis and Proof of Correctness.mp4 47.3 MB
  • 2. Trees and Graphs Basics/Week 1/4. Red-Black Trees -- RotationsAlgorithms for Insertion (and Deletion).mp4 46.2 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/4. Master Method Revisited.mp4 45.8 MB
  • 1/Week 4/4. Count-Min Sketching Using Hashing.mp4 45.5 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/2. Polynomial Time Problems.mp4 45.4 MB
  • 2. Trees and Graphs Basics/Week 4/1. Shortest Path Problems and Their Properties.mp4 45.0 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/6. Computation and Physics.mp4 44.3 MB
  • 2. Trees and Graphs Basics/Week 3/1. Amortized Analysis of Data Structures.mp4 44.1 MB
  • 2. Trees and Graphs Basics/Week 3/2. Amortized Analysis Potential Functions.mp4 42.8 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/5. NP Complete Problems Examples.mp4 41.4 MB
  • 1/Week 2/3. Heap Primitives Bubble UpBubble Down.mp4 41.0 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/7. FFT Part 3 Divide and Conquer Algorithm for FFT.mp4 40.4 MB
  • 1/Week 2/4. Priority Queues, Heapify, and Heapsort.mp4 40.1 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/9. Application # 2 Data Analysis using FFT.mp4 36.2 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/8. Bell's Inequality.mp4 35.6 MB
  • 1/Week 2/2. Heap, MinMax-Heaps and Properties of Heaps.mp4 35.3 MB
  • 1/Week 2/1. A Simple Data Structure The Dynamic Array.mp4 34.9 MB
  • 1/Week 3/6. Selecting Hash Functions.mp4 34.5 MB
  • 1/Week 1/5. Binary Search.mp4 34.4 MB
  • 1/Week 3/1. Introduction to Randomization + Average Case Analysis + Recurrences.mp4 33.7 MB
  • 2. Trees and Graphs Basics/Week 4/3. Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights.mp4 32.4 MB
  • 1/Week 4/1. Open Address Hashing.mp4 27.5 MB
  • 1/Week 4/5. String Matching Using Hashing.mp4 24.9 MB
  • 1/Week 2/5. Hashtables - Introduction.mp4 24.6 MB
  • 1/Week 4/3. Bloom Filters and Analysis.mp4 20.3 MB
  • 2. Trees and Graphs Basics/Week 4/4. Proof of Dijkstra's Algorithm.mp4 19.7 MB
  • 2. Trees and Graphs Basics/Week 4/5. Shortest Path on DAGs.mp4 17.9 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/8. Application # 1 Fast Polynomial Multiplication using FFT.mp4 14.0 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/1. What Are Divide and Conquer Algorithms.mp4 11.7 MB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/FastFourierTransform.ipynb 7.2 MB
  • 1/Week 4/ovRfLB10Q8u0XywddOPL7g_2f07a1b9931243ceb8289e924247c235_count-min-sketches.pdf 3.7 MB
  • 1/Week 4/8dYkKltWSAyWJCpbVngMhQ_6595c98b71334fccbcfc88c4c7e926f4_string-matching-rabin-karp-scribbles.pdf 2.4 MB
  • 1/Week 4/VVuQGd3MSNKbkBndzBjSmA_34a8ab8d201945fdae1e1f4cb5d89daa_bloom-filters-1.pdf 2.2 MB
  • 1/Week 4/OAilEjknRImIpRI5J-SJKg_211383a521614320a0e1d8c71e251d2c_count-min-sketches.pdf 152.6 kB
  • 1/Week 4/QXlfyz5JTLq5X8s-Sdy6Pg_f20f5b73ac8a49feb2bea7dfe86c8a96_bloom-filters.pdf 127.1 kB
  • 1/Week 1/IthcSwTBS5SYXEsEwYuUug_2a37b826decb42ad982343140394391d_binarySearchLecture.pdf 97.9 kB
  • 1/Week 1/2. An Introduction Through the Insertion Sort Algorithm.srt 65.9 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/5. FFT Part 1 Introduction and Complex Numbers.srt 64.7 kB
  • 2. Trees and Graphs Basics/Week 3/5. Union-Find Data Structures and Rank Compression.srt 57.6 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/9. Grover's Search Algorithm.srt 53.8 kB
  • 1/Week 4/2. Perfect hashing and Cuckoo hashing.srt 53.6 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/3. Karatsuba’s Multiplication Algorithm.srt 53.5 kB
  • 1/Week 1/tINsz0vhQx2DbM9L4bMdqw_408b5978f7e14c33a00ba6c7bcdf4754_mergesort.pdf 53.2 kB
  • 2. Trees and Graphs Basics/Week 4/2. Bellman-Ford Algorithm for Single Source Shortest Paths.srt 51.9 kB
  • 2. Trees and Graphs Basics/Week 2/3. Depth First Search.srt 50.3 kB
  • 1/Week 4/4. Count-Min Sketching Using Hashing.srt 49.1 kB
  • 1/Week 1/6. Merge Sort Algorithm, Analysis and Proof of Correctness.srt 46.0 kB
  • 2. Trees and Graphs Basics/Week 3/1. Amortized Analysis of Data Structures.srt 45.7 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/1. Decision Problems and Languages.srt 45.0 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/4. NP Completeness and Reductions.srt 44.6 kB
  • 2. Trees and Graphs Basics/Week 1/5. Skip Lists.srt 44.1 kB
  • 1/Week 1/4. Asymptotic Notation.srt 43.7 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/6. FFT Part 2 Definition and Interpretation of Discrete Fourier Transforms.srt 43.4 kB
  • 1/Week 1/3. Time and Space Complexity.srt 43.3 kB
  • 2. Trees and Graphs Basics/Week 3/2. Amortized Analysis Potential Functions.srt 42.6 kB
  • 2. Trees and Graphs Basics/Week 4/6. All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm.srt 42.4 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/7. Qubits and Operations.srt 42.3 kB
  • 2. Trees and Graphs Basics/Week 1/3. Red-Black Trees Basics.srt 41.7 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/4. Knapsack Problem.srt 41.3 kB
  • 2. Trees and Graphs Basics/Week 1/2. Binary Search Trees -- Insertion and Deletion.srt 41.0 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/3. Prefix Codes.srt 40.5 kB
  • 1/Week 3/4. Analysis of Quicksort Algorithm.srt 39.8 kB
  • 1/Week 1/1. What is an Algorithm.srt 39.4 kB
  • 2. Trees and Graphs Basics/Week 3/3. Spanning Trees and Minimal Spanning Trees with Applications.srt 38.6 kB
  • 1/Week 3/6. Selecting Hash Functions.srt 38.3 kB
  • 2. Trees and Graphs Basics/Week 4/1. Shortest Path Problems and Their Properties.srt 37.9 kB
  • 1/Week 2/4. Priority Queues, Heapify, and Heapsort.srt 37.2 kB
  • 1/Week 3/1. Introduction to Randomization + Average Case Analysis + Recurrences.srt 36.8 kB
  • 2. Trees and Graphs Basics/Week 1/4. Red-Black Trees -- RotationsAlgorithms for Insertion (and Deletion).srt 36.3 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/6. Computation and Physics.srt 36.2 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/1. Introduction to Dynamic Programming + Rod Cutting Problem.srt 36.2 kB
  • 1/Week 1/5. Binary Search.srt 36.0 kB
  • 1/Week 2/3. Heap Primitives Bubble UpBubble Down.srt 35.6 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/3. NP Definition.srt 34.5 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/2. Rod Cutting Problem Memoization.srt 34.4 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/2. Max Subarray Problem Using Divide and Conquer.srt 34.2 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/2. Polynomial Time Problems.srt 33.4 kB
  • 1/Week 3/3. Detailed Design of Partitioning Schemes.srt 32.2 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/6. Dynamic Programming Longest Common Subsequence.srt 31.1 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/4. Master Method Revisited.srt 30.9 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/2. Greedy Interval Scheduling.srt 30.6 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/5. NP Complete Problems Examples.srt 30.1 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/1. Introduction to Greedy Algorithms.srt 29.7 kB
  • 1/Week 2/1. A Simple Data Structure The Dynamic Array.srt 28.7 kB
  • 2. Trees and Graphs Basics/Week 1/1. Binary Search Trees -- Introduction and Properties.srt 28.5 kB
  • 1/Week 2/5. Hashtables - Introduction.srt 28.1 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/7. FFT Part 3 Divide and Conquer Algorithm for FFT.srt 28.0 kB
  • 1/Week 3/7. Universal Hash Functions and Analysis.srt 27.8 kB
  • 1/Week 4/5. String Matching Using Hashing.srt 27.4 kB
  • 1/Week 4/1. Open Address Hashing.srt 27.1 kB
  • 1/Week 2/2. Heap, MinMax-Heaps and Properties of Heaps.srt 26.5 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 4/8. Bell's Inequality.srt 25.1 kB
  • 2. Trees and Graphs Basics/Week 2/6. Strongly Connected Components - Properties.srt 24.8 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/5. Huffman Codes Proof of Optimality.srt 24.6 kB
  • 1/Week 1/7. Pitfalls and Logarithms.srt 24.4 kB
  • 1/Week 3/5. Quickselect Algorithm and its Applications.srt 23.8 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/9. Application # 2 Data Analysis using FFT.srt 23.7 kB
  • 2. Trees and Graphs Basics/Week 2/7. Strongly Connected Components - Algorithm.srt 22.9 kB
  • 2. Trees and Graphs Basics/Week 2/2. Graph Traversals and Breadth First Traversal.srt 22.6 kB
  • 1/Week 4/3. Bloom Filters and Analysis.srt 22.4 kB
  • 2. Trees and Graphs Basics/Week 4/3. Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights.srt 21.9 kB
  • 1/Week 3/2. Partition and Quicksort Algorithm.srt 21.6 kB
  • 2. Trees and Graphs Basics/Week 2/5. Strongly Connected Components - Definitions.srt 20.5 kB
  • 2. Trees and Graphs Basics/Week 2/1. Graphs and Their Representations.srt 18.6 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/3. Coin Changing Problem.srt 18.0 kB
  • 1/Week 1/QWMV-nQQRVujFfp0EPVbjg_4e706aac6dcc406db9d7c05c1bbdc581_BinarySearch---Notes.json 15.3 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 3/4. Huffman Codes.srt 15.1 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/Karatsuba Multiplication Algorithm.ipynb 14.9 kB
  • 2. Trees and Graphs Basics/Week 4/4. Proof of Dijkstra's Algorithm.srt 14.7 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/5. When Optimal Substructure Fails.srt 14.7 kB
  • 2. Trees and Graphs Basics/Week 2/4. Topological Sorting and Applications.srt 14.7 kB
  • 1/Week 1/BNDFacHNTJiQxWnBzdyYsg_7b927f7ea2d044b59cd733ab9ddbd36a_Mergesort---Notes.json 13.2 kB
  • 2. Trees and Graphs Basics/Week 4/5. Shortest Path on DAGs.srt 13.1 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/1. What Are Divide and Conquer Algorithms.srt 12.5 kB
  • 2. Trees and Graphs Basics/Week 3/4. Kruskal’s Algorithm for Finding Minimal Spanning Trees.srt 11.5 kB
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/8. Application # 1 Fast Polynomial Multiplication using FFT.srt 9.7 kB
  • 1/Week 2/1. A Simple Data Structure The Dynamic Array.txt 85 Bytes
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/1. Introduction to Dynamic Programming + Rod Cutting Problem.txt 85 Bytes
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/3. Coin Changing Problem.txt 85 Bytes
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/4. Knapsack Problem.txt 85 Bytes
  • 3. Dynamic Programming, Greedy Algorithms/Week 2/2. Rod Cutting Problem Memoization.txt 79 Bytes
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/Videos.txt 70 Bytes
  • [CourseClub.Me].url 66 Bytes
  • 1/book.txt 50 Bytes
  • 3. Dynamic Programming, Greedy Algorithms/Week 1/Fourier Transforms.txt 28 Bytes

随机展示

相关说明

本站不存储任何资源内容，只收集BT种子元数据(例如文件名和文件大小)和磁力链接(BT种子标识符)，并提供查询服务，是一个完全合法的搜索引擎系统。 网站不提供种子下载服务，用户可以通过第三方链接或磁力链接获取到相关的种子资源。本站也不对BT种子真实性及合法性负责，请用户注意甄别！