589689.xyz

[] Coursera - Data Science Foundations Data Structures and Algorithms Specialization

  • 收录时间:2024-01-13 17:08:44
  • 文件大小:6GB
  • 下载次数:1
  • 最近下载:2024-01-13 17:08:44
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 2. Trees and Graphs Basics/Week 2/3. Depth First Search.mp4 208MB
  2. 3. Dynamic Programming, Greedy Algorithms/Week 1/3. Karatsuba’s Multiplication Algorithm.mp4 181MB
  3. 1/Week 1/2. An Introduction Through the Insertion Sort Algorithm.mp4 170MB
  4. 3. Dynamic Programming, Greedy Algorithms/Week 2/4. Knapsack Problem.mp4 168MB
  5. 1/Week 1/4. Asymptotic Notation.mp4 163MB
  6. 1/Week 1/3. Time and Space Complexity.mp4 163MB
  7. 3. Dynamic Programming, Greedy Algorithms/Week 2/1. Introduction to Dynamic Programming + Rod Cutting Problem.mp4 161MB
  8. 1/Week 3/4. Analysis of Quicksort Algorithm.mp4 160MB
  9. 3. Dynamic Programming, Greedy Algorithms/Week 3/3. Prefix Codes.mp4 158MB
  10. 2. Trees and Graphs Basics/Week 1/2. Binary Search Trees -- Insertion and Deletion.mp4 154MB
  11. 2. Trees and Graphs Basics/Week 3/3. Spanning Trees and Minimal Spanning Trees with Applications.mp4 150MB
  12. 1/Week 1/1. What is an Algorithm.mp4 146MB
  13. 3. Dynamic Programming, Greedy Algorithms/Week 2/6. Dynamic Programming Longest Common Subsequence.mp4 139MB
  14. 1/Week 3/3. Detailed Design of Partitioning Schemes.mp4 137MB
  15. 3. Dynamic Programming, Greedy Algorithms/Week 2/2. Rod Cutting Problem Memoization.mp4 128MB
  16. 3. Dynamic Programming, Greedy Algorithms/Week 1/2. Max Subarray Problem Using Divide and Conquer.mp4 125MB
  17. 3. Dynamic Programming, Greedy Algorithms/Week 3/2. Greedy Interval Scheduling.mp4 124MB
  18. 3. Dynamic Programming, Greedy Algorithms/Week 3/1. Introduction to Greedy Algorithms.mp4 105MB
  19. 2. Trees and Graphs Basics/Week 1/1. Binary Search Trees -- Introduction and Properties.mp4 104MB
  20. 3. Dynamic Programming, Greedy Algorithms/Week 3/5. Huffman Codes Proof of Optimality.mp4 99MB
  21. 1/Week 3/7. Universal Hash Functions and Analysis.mp4 97MB
  22. 1/Week 3/5. Quickselect Algorithm and its Applications.mp4 96MB
  23. 2. Trees and Graphs Basics/Week 2/6. Strongly Connected Components - Properties.mp4 93MB
  24. 2. Trees and Graphs Basics/Week 2/7. Strongly Connected Components - Algorithm.mp4 91MB
  25. 2. Trees and Graphs Basics/Week 2/5. Strongly Connected Components - Definitions.mp4 86MB
  26. 1/Week 1/7. Pitfalls and Logarithms.mp4 84MB
  27. 2. Trees and Graphs Basics/Week 2/2. Graph Traversals and Breadth First Traversal.mp4 83MB
  28. 2. Trees and Graphs Basics/Week 4/2. Bellman-Ford Algorithm for Single Source Shortest Paths.mp4 75MB
  29. 1/Week 3/2. Partition and Quicksort Algorithm.mp4 75MB
  30. 3. Dynamic Programming, Greedy Algorithms/Week 1/5. FFT Part 1 Introduction and Complex Numbers.mp4 71MB
  31. 2. Trees and Graphs Basics/Week 2/1. Graphs and Their Representations.mp4 66MB
  32. 2. Trees and Graphs Basics/Week 2/4. Topological Sorting and Applications.mp4 65MB
  33. 3. Dynamic Programming, Greedy Algorithms/Week 4/9. Grover's Search Algorithm.mp4 64MB
  34. 3. Dynamic Programming, Greedy Algorithms/Week 4/4. NP Completeness and Reductions.mp4 64MB
  35. 3. Dynamic Programming, Greedy Algorithms/Week 2/3. Coin Changing Problem.mp4 64MB
  36. 3. Dynamic Programming, Greedy Algorithms/Week 4/1. Decision Problems and Languages.mp4 58MB
  37. 2. Trees and Graphs Basics/Week 3/5. Union-Find Data Structures and Rank Compression.mp4 56MB
  38. 3. Dynamic Programming, Greedy Algorithms/Week 4/7. Qubits and Operations.mp4 55MB
  39. 3. Dynamic Programming, Greedy Algorithms/Week 2/5. When Optimal Substructure Fails.mp4 55MB
  40. 2. Trees and Graphs Basics/Week 4/6. All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm.mp4 53MB
  41. 3. Dynamic Programming, Greedy Algorithms/Week 1/6. FFT Part 2 Definition and Interpretation of Discrete Fourier Transforms.mp4 51MB
  42. 3. Dynamic Programming, Greedy Algorithms/Week 3/4. Huffman Codes.mp4 50MB
  43. 2. Trees and Graphs Basics/Week 1/3. Red-Black Trees Basics.mp4 49MB
  44. 1/Week 4/2. Perfect hashing and Cuckoo hashing.mp4 48MB
  45. 3. Dynamic Programming, Greedy Algorithms/Week 4/3. NP Definition.mp4 48MB
  46. 2. Trees and Graphs Basics/Week 3/4. Kruskal’s Algorithm for Finding Minimal Spanning Trees.mp4 47MB
  47. 2. Trees and Graphs Basics/Week 1/5. Skip Lists.mp4 46MB
  48. 1/Week 1/6. Merge Sort Algorithm, Analysis and Proof of Correctness.mp4 45MB
  49. 2. Trees and Graphs Basics/Week 1/4. Red-Black Trees -- RotationsAlgorithms for Insertion (and Deletion).mp4 44MB
  50. 3. Dynamic Programming, Greedy Algorithms/Week 1/4. Master Method Revisited.mp4 44MB
  51. 1/Week 4/4. Count-Min Sketching Using Hashing.mp4 43MB
  52. 3. Dynamic Programming, Greedy Algorithms/Week 4/2. Polynomial Time Problems.mp4 43MB
  53. 2. Trees and Graphs Basics/Week 4/1. Shortest Path Problems and Their Properties.mp4 43MB
  54. 3. Dynamic Programming, Greedy Algorithms/Week 4/6. Computation and Physics.mp4 42MB
  55. 2. Trees and Graphs Basics/Week 3/1. Amortized Analysis of Data Structures.mp4 42MB
  56. 2. Trees and Graphs Basics/Week 3/2. Amortized Analysis Potential Functions.mp4 41MB
  57. 3. Dynamic Programming, Greedy Algorithms/Week 4/5. NP Complete Problems Examples.mp4 40MB
  58. 1/Week 2/3. Heap Primitives Bubble UpBubble Down.mp4 39MB
  59. 3. Dynamic Programming, Greedy Algorithms/Week 1/7. FFT Part 3 Divide and Conquer Algorithm for FFT.mp4 39MB
  60. 1/Week 2/4. Priority Queues, Heapify, and Heapsort.mp4 38MB
  61. 3. Dynamic Programming, Greedy Algorithms/Week 1/9. Application # 2 Data Analysis using FFT.mp4 34MB
  62. 3. Dynamic Programming, Greedy Algorithms/Week 4/8. Bell's Inequality.mp4 34MB
  63. 1/Week 2/2. Heap, MinMax-Heaps and Properties of Heaps.mp4 34MB
  64. 1/Week 2/1. A Simple Data Structure The Dynamic Array.mp4 33MB
  65. 1/Week 3/6. Selecting Hash Functions.mp4 33MB
  66. 1/Week 1/5. Binary Search.mp4 33MB
  67. 1/Week 3/1. Introduction to Randomization + Average Case Analysis + Recurrences.mp4 32MB
  68. 2. Trees and Graphs Basics/Week 4/3. Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights.mp4 31MB
  69. 1/Week 4/1. Open Address Hashing.mp4 26MB
  70. 1/Week 4/5. String Matching Using Hashing.mp4 24MB
  71. 1/Week 2/5. Hashtables - Introduction.mp4 23MB
  72. 1/Week 4/3. Bloom Filters and Analysis.mp4 19MB
  73. 2. Trees and Graphs Basics/Week 4/4. Proof of Dijkstra's Algorithm.mp4 19MB
  74. 2. Trees and Graphs Basics/Week 4/5. Shortest Path on DAGs.mp4 17MB
  75. 3. Dynamic Programming, Greedy Algorithms/Week 1/8. Application # 1 Fast Polynomial Multiplication using FFT.mp4 13MB
  76. 3. Dynamic Programming, Greedy Algorithms/Week 1/1. What Are Divide and Conquer Algorithms.mp4 11MB
  77. 3. Dynamic Programming, Greedy Algorithms/Week 1/FastFourierTransform.ipynb 7MB
  78. 1/Week 4/ovRfLB10Q8u0XywddOPL7g_2f07a1b9931243ceb8289e924247c235_count-min-sketches.pdf 4MB
  79. 1/Week 4/8dYkKltWSAyWJCpbVngMhQ_6595c98b71334fccbcfc88c4c7e926f4_string-matching-rabin-karp-scribbles.pdf 2MB
  80. 1/Week 4/VVuQGd3MSNKbkBndzBjSmA_34a8ab8d201945fdae1e1f4cb5d89daa_bloom-filters-1.pdf 2MB
  81. 1/Week 4/OAilEjknRImIpRI5J-SJKg_211383a521614320a0e1d8c71e251d2c_count-min-sketches.pdf 149KB
  82. 1/Week 4/QXlfyz5JTLq5X8s-Sdy6Pg_f20f5b73ac8a49feb2bea7dfe86c8a96_bloom-filters.pdf 124KB
  83. 1/Week 1/IthcSwTBS5SYXEsEwYuUug_2a37b826decb42ad982343140394391d_binarySearchLecture.pdf 96KB
  84. 1/Week 1/2. An Introduction Through the Insertion Sort Algorithm.srt 64KB
  85. 3. Dynamic Programming, Greedy Algorithms/Week 1/5. FFT Part 1 Introduction and Complex Numbers.srt 63KB
  86. 2. Trees and Graphs Basics/Week 3/5. Union-Find Data Structures and Rank Compression.srt 56KB
  87. 3. Dynamic Programming, Greedy Algorithms/Week 4/9. Grover's Search Algorithm.srt 53KB
  88. 1/Week 4/2. Perfect hashing and Cuckoo hashing.srt 52KB
  89. 3. Dynamic Programming, Greedy Algorithms/Week 1/3. Karatsuba’s Multiplication Algorithm.srt 52KB
  90. 1/Week 1/tINsz0vhQx2DbM9L4bMdqw_408b5978f7e14c33a00ba6c7bcdf4754_mergesort.pdf 52KB
  91. 2. Trees and Graphs Basics/Week 4/2. Bellman-Ford Algorithm for Single Source Shortest Paths.srt 51KB
  92. 2. Trees and Graphs Basics/Week 2/3. Depth First Search.srt 49KB
  93. 1/Week 4/4. Count-Min Sketching Using Hashing.srt 48KB
  94. 1/Week 1/6. Merge Sort Algorithm, Analysis and Proof of Correctness.srt 45KB
  95. 2. Trees and Graphs Basics/Week 3/1. Amortized Analysis of Data Structures.srt 45KB
  96. 3. Dynamic Programming, Greedy Algorithms/Week 4/1. Decision Problems and Languages.srt 44KB
  97. 3. Dynamic Programming, Greedy Algorithms/Week 4/4. NP Completeness and Reductions.srt 44KB
  98. 2. Trees and Graphs Basics/Week 1/5. Skip Lists.srt 43KB
  99. 1/Week 1/4. Asymptotic Notation.srt 43KB
  100. 3. Dynamic Programming, Greedy Algorithms/Week 1/6. FFT Part 2 Definition and Interpretation of Discrete Fourier Transforms.srt 42KB
  101. 1/Week 1/3. Time and Space Complexity.srt 42KB
  102. 2. Trees and Graphs Basics/Week 3/2. Amortized Analysis Potential Functions.srt 42KB
  103. 2. Trees and Graphs Basics/Week 4/6. All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm.srt 41KB
  104. 3. Dynamic Programming, Greedy Algorithms/Week 4/7. Qubits and Operations.srt 41KB
  105. 2. Trees and Graphs Basics/Week 1/3. Red-Black Trees Basics.srt 41KB
  106. 3. Dynamic Programming, Greedy Algorithms/Week 2/4. Knapsack Problem.srt 40KB
  107. 2. Trees and Graphs Basics/Week 1/2. Binary Search Trees -- Insertion and Deletion.srt 40KB
  108. 3. Dynamic Programming, Greedy Algorithms/Week 3/3. Prefix Codes.srt 40KB
  109. 1/Week 3/4. Analysis of Quicksort Algorithm.srt 39KB
  110. 1/Week 1/1. What is an Algorithm.srt 38KB
  111. 2. Trees and Graphs Basics/Week 3/3. Spanning Trees and Minimal Spanning Trees with Applications.srt 38KB
  112. 1/Week 3/6. Selecting Hash Functions.srt 37KB
  113. 2. Trees and Graphs Basics/Week 4/1. Shortest Path Problems and Their Properties.srt 37KB
  114. 1/Week 2/4. Priority Queues, Heapify, and Heapsort.srt 36KB
  115. 1/Week 3/1. Introduction to Randomization + Average Case Analysis + Recurrences.srt 36KB
  116. 2. Trees and Graphs Basics/Week 1/4. Red-Black Trees -- RotationsAlgorithms for Insertion (and Deletion).srt 35KB
  117. 3. Dynamic Programming, Greedy Algorithms/Week 4/6. Computation and Physics.srt 35KB
  118. 3. Dynamic Programming, Greedy Algorithms/Week 2/1. Introduction to Dynamic Programming + Rod Cutting Problem.srt 35KB
  119. 1/Week 1/5. Binary Search.srt 35KB
  120. 1/Week 2/3. Heap Primitives Bubble UpBubble Down.srt 35KB
  121. 3. Dynamic Programming, Greedy Algorithms/Week 4/3. NP Definition.srt 34KB
  122. 3. Dynamic Programming, Greedy Algorithms/Week 2/2. Rod Cutting Problem Memoization.srt 34KB
  123. 3. Dynamic Programming, Greedy Algorithms/Week 1/2. Max Subarray Problem Using Divide and Conquer.srt 33KB
  124. 3. Dynamic Programming, Greedy Algorithms/Week 4/2. Polynomial Time Problems.srt 33KB
  125. 1/Week 3/3. Detailed Design of Partitioning Schemes.srt 31KB
  126. 3. Dynamic Programming, Greedy Algorithms/Week 2/6. Dynamic Programming Longest Common Subsequence.srt 30KB
  127. 3. Dynamic Programming, Greedy Algorithms/Week 1/4. Master Method Revisited.srt 30KB
  128. 3. Dynamic Programming, Greedy Algorithms/Week 3/2. Greedy Interval Scheduling.srt 30KB
  129. 3. Dynamic Programming, Greedy Algorithms/Week 4/5. NP Complete Problems Examples.srt 29KB
  130. 3. Dynamic Programming, Greedy Algorithms/Week 3/1. Introduction to Greedy Algorithms.srt 29KB
  131. 1/Week 2/1. A Simple Data Structure The Dynamic Array.srt 28KB
  132. 2. Trees and Graphs Basics/Week 1/1. Binary Search Trees -- Introduction and Properties.srt 28KB
  133. 1/Week 2/5. Hashtables - Introduction.srt 27KB
  134. 3. Dynamic Programming, Greedy Algorithms/Week 1/7. FFT Part 3 Divide and Conquer Algorithm for FFT.srt 27KB
  135. 1/Week 3/7. Universal Hash Functions and Analysis.srt 27KB
  136. 1/Week 4/5. String Matching Using Hashing.srt 27KB
  137. 1/Week 4/1. Open Address Hashing.srt 27KB
  138. 1/Week 2/2. Heap, MinMax-Heaps and Properties of Heaps.srt 26KB
  139. 3. Dynamic Programming, Greedy Algorithms/Week 4/8. Bell's Inequality.srt 25KB
  140. 2. Trees and Graphs Basics/Week 2/6. Strongly Connected Components - Properties.srt 24KB
  141. 3. Dynamic Programming, Greedy Algorithms/Week 3/5. Huffman Codes Proof of Optimality.srt 24KB
  142. 1/Week 1/7. Pitfalls and Logarithms.srt 24KB
  143. 1/Week 3/5. Quickselect Algorithm and its Applications.srt 23KB
  144. 3. Dynamic Programming, Greedy Algorithms/Week 1/9. Application # 2 Data Analysis using FFT.srt 23KB
  145. 2. Trees and Graphs Basics/Week 2/7. Strongly Connected Components - Algorithm.srt 22KB
  146. 2. Trees and Graphs Basics/Week 2/2. Graph Traversals and Breadth First Traversal.srt 22KB
  147. 1/Week 4/3. Bloom Filters and Analysis.srt 22KB
  148. 2. Trees and Graphs Basics/Week 4/3. Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights.srt 21KB
  149. 1/Week 3/2. Partition and Quicksort Algorithm.srt 21KB
  150. 2. Trees and Graphs Basics/Week 2/5. Strongly Connected Components - Definitions.srt 20KB
  151. 2. Trees and Graphs Basics/Week 2/1. Graphs and Their Representations.srt 18KB
  152. 3. Dynamic Programming, Greedy Algorithms/Week 2/3. Coin Changing Problem.srt 18KB
  153. 1/Week 1/QWMV-nQQRVujFfp0EPVbjg_4e706aac6dcc406db9d7c05c1bbdc581_BinarySearch---Notes.json 15KB
  154. 3. Dynamic Programming, Greedy Algorithms/Week 3/4. Huffman Codes.srt 15KB
  155. 3. Dynamic Programming, Greedy Algorithms/Week 1/Karatsuba Multiplication Algorithm.ipynb 15KB
  156. 2. Trees and Graphs Basics/Week 4/4. Proof of Dijkstra's Algorithm.srt 14KB
  157. 3. Dynamic Programming, Greedy Algorithms/Week 2/5. When Optimal Substructure Fails.srt 14KB
  158. 2. Trees and Graphs Basics/Week 2/4. Topological Sorting and Applications.srt 14KB
  159. 1/Week 1/BNDFacHNTJiQxWnBzdyYsg_7b927f7ea2d044b59cd733ab9ddbd36a_Mergesort---Notes.json 13KB
  160. 2. Trees and Graphs Basics/Week 4/5. Shortest Path on DAGs.srt 13KB
  161. 3. Dynamic Programming, Greedy Algorithms/Week 1/1. What Are Divide and Conquer Algorithms.srt 12KB
  162. 2. Trees and Graphs Basics/Week 3/4. Kruskal’s Algorithm for Finding Minimal Spanning Trees.srt 11KB
  163. 3. Dynamic Programming, Greedy Algorithms/Week 1/8. Application # 1 Fast Polynomial Multiplication using FFT.srt 9KB
  164. 1/Week 2/1. A Simple Data Structure The Dynamic Array.txt 85B
  165. 3. Dynamic Programming, Greedy Algorithms/Week 2/1. Introduction to Dynamic Programming + Rod Cutting Problem.txt 85B
  166. 3. Dynamic Programming, Greedy Algorithms/Week 2/3. Coin Changing Problem.txt 85B
  167. 3. Dynamic Programming, Greedy Algorithms/Week 2/4. Knapsack Problem.txt 85B
  168. 3. Dynamic Programming, Greedy Algorithms/Week 2/2. Rod Cutting Problem Memoization.txt 79B
  169. 3. Dynamic Programming, Greedy Algorithms/Week 1/Videos.txt 70B
  170. [CourseClub.Me].url 66B
  171. 1/book.txt 50B
  172. 3. Dynamic Programming, Greedy Algorithms/Week 1/Fourier Transforms.txt 28B