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

Creation Time	Dec. 2, 2024, 8:15 p.m.
Last Access Time	Dec. 4, 2024, 8:06 p.m.
File Size	5.6 GB
Keywords	Me and Structures CourseClub Coursera - Algorithms Science Foundations Data Specialization
Total Requests	2
Total Files	172
Magnet Link	Please wait ...
	Download (Magnet Link) Play (Watch Online)

2. Trees and Graphs Basics/Week 2/3. Depth First Search.mp4 207.9 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/3. Karatsuba’s Multiplication Algorithm.mp4 180.9 MB
1/Week 1/2. An Introduction Through the Insertion Sort Algorithm.mp4 170.0 MB
3. Dynamic Programming, Greedy Algorithms/Week 2/4. Knapsack Problem.mp4 168.4 MB
1/Week 1/4. Asymptotic Notation.mp4 163.3 MB
1/Week 1/3. Time and Space Complexity.mp4 163.3 MB
3. Dynamic Programming, Greedy Algorithms/Week 2/1. Introduction to Dynamic Programming + Rod Cutting Problem.mp4 160.7 MB
1/Week 3/4. Analysis of Quicksort Algorithm.mp4 160.3 MB
3. Dynamic Programming, Greedy Algorithms/Week 3/3. Prefix Codes.mp4 157.8 MB
2. Trees and Graphs Basics/Week 1/2. Binary Search Trees -- Insertion and Deletion.mp4 153.9 MB
2. Trees and Graphs Basics/Week 3/3. Spanning Trees and Minimal Spanning Trees with Applications.mp4 149.7 MB
1/Week 1/1. What is an Algorithm.mp4 145.6 MB
3. Dynamic Programming, Greedy Algorithms/Week 2/6. Dynamic Programming Longest Common Subsequence.mp4 139.5 MB
1/Week 3/3. Detailed Design of Partitioning Schemes.mp4 136.9 MB
3. Dynamic Programming, Greedy Algorithms/Week 2/2. Rod Cutting Problem Memoization.mp4 127.8 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/2. Max Subarray Problem Using Divide and Conquer.mp4 124.8 MB
3. Dynamic Programming, Greedy Algorithms/Week 3/2. Greedy Interval Scheduling.mp4 124.4 MB
3. Dynamic Programming, Greedy Algorithms/Week 3/1. Introduction to Greedy Algorithms.mp4 104.7 MB
2. Trees and Graphs Basics/Week 1/1. Binary Search Trees -- Introduction and Properties.mp4 103.7 MB
3. Dynamic Programming, Greedy Algorithms/Week 3/5. Huffman Codes Proof of Optimality.mp4 99.3 MB
1/Week 3/7. Universal Hash Functions and Analysis.mp4 97.2 MB
1/Week 3/5. Quickselect Algorithm and its Applications.mp4 96.4 MB
2. Trees and Graphs Basics/Week 2/6. Strongly Connected Components - Properties.mp4 92.7 MB
2. Trees and Graphs Basics/Week 2/7. Strongly Connected Components - Algorithm.mp4 91.2 MB
2. Trees and Graphs Basics/Week 2/5. Strongly Connected Components - Definitions.mp4 86.0 MB
1/Week 1/7. Pitfalls and Logarithms.mp4 84.4 MB
2. Trees and Graphs Basics/Week 2/2. Graph Traversals and Breadth First Traversal.mp4 82.8 MB
2. Trees and Graphs Basics/Week 4/2. Bellman-Ford Algorithm for Single Source Shortest Paths.mp4 75.1 MB
1/Week 3/2. Partition and Quicksort Algorithm.mp4 74.7 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/5. FFT Part 1 Introduction and Complex Numbers.mp4 70.6 MB
2. Trees and Graphs Basics/Week 2/1. Graphs and Their Representations.mp4 65.9 MB
2. Trees and Graphs Basics/Week 2/4. Topological Sorting and Applications.mp4 64.7 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/9. Grover's Search Algorithm.mp4 64.0 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/4. NP Completeness and Reductions.mp4 63.9 MB
3. Dynamic Programming, Greedy Algorithms/Week 2/3. Coin Changing Problem.mp4 63.6 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/1. Decision Problems and Languages.mp4 57.9 MB
2. Trees and Graphs Basics/Week 3/5. Union-Find Data Structures and Rank Compression.mp4 56.3 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/7. Qubits and Operations.mp4 55.2 MB
3. Dynamic Programming, Greedy Algorithms/Week 2/5. When Optimal Substructure Fails.mp4 54.7 MB
2. Trees and Graphs Basics/Week 4/6. All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm.mp4 53.4 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/6. FFT Part 2 Definition and Interpretation of Discrete Fourier Transforms.mp4 50.9 MB
3. Dynamic Programming, Greedy Algorithms/Week 3/4. Huffman Codes.mp4 49.5 MB
2. Trees and Graphs Basics/Week 1/3. Red-Black Trees Basics.mp4 48.5 MB
1/Week 4/2. Perfect hashing and Cuckoo hashing.mp4 48.4 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/3. NP Definition.mp4 47.7 MB
2. Trees and Graphs Basics/Week 3/4. Kruskal’s Algorithm for Finding Minimal Spanning Trees.mp4 46.7 MB
2. Trees and Graphs Basics/Week 1/5. Skip Lists.mp4 45.8 MB
1/Week 1/6. Merge Sort Algorithm, Analysis and Proof of Correctness.mp4 45.1 MB
2. Trees and Graphs Basics/Week 1/4. Red-Black Trees -- RotationsAlgorithms for Insertion (and Deletion).mp4 44.0 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/4. Master Method Revisited.mp4 43.7 MB
1/Week 4/4. Count-Min Sketching Using Hashing.mp4 43.4 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/2. Polynomial Time Problems.mp4 43.3 MB
2. Trees and Graphs Basics/Week 4/1. Shortest Path Problems and Their Properties.mp4 43.0 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/6. Computation and Physics.mp4 42.3 MB
2. Trees and Graphs Basics/Week 3/1. Amortized Analysis of Data Structures.mp4 42.1 MB
2. Trees and Graphs Basics/Week 3/2. Amortized Analysis Potential Functions.mp4 40.8 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/5. NP Complete Problems Examples.mp4 39.5 MB
1/Week 2/3. Heap Primitives Bubble UpBubble Down.mp4 39.1 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/7. FFT Part 3 Divide and Conquer Algorithm for FFT.mp4 38.5 MB
1/Week 2/4. Priority Queues, Heapify, and Heapsort.mp4 38.3 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/9. Application # 2 Data Analysis using FFT.mp4 34.5 MB
3. Dynamic Programming, Greedy Algorithms/Week 4/8. Bell's Inequality.mp4 33.9 MB
1/Week 2/2. Heap, MinMax-Heaps and Properties of Heaps.mp4 33.6 MB
1/Week 2/1. A Simple Data Structure The Dynamic Array.mp4 33.3 MB
1/Week 3/6. Selecting Hash Functions.mp4 32.9 MB
1/Week 1/5. Binary Search.mp4 32.8 MB
1/Week 3/1. Introduction to Randomization + Average Case Analysis + Recurrences.mp4 32.2 MB
2. Trees and Graphs Basics/Week 4/3. Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights.mp4 30.9 MB
1/Week 4/1. Open Address Hashing.mp4 26.3 MB
1/Week 4/5. String Matching Using Hashing.mp4 23.7 MB
1/Week 2/5. Hashtables - Introduction.mp4 23.4 MB
1/Week 4/3. Bloom Filters and Analysis.mp4 19.3 MB
2. Trees and Graphs Basics/Week 4/4. Proof of Dijkstra's Algorithm.mp4 18.8 MB
2. Trees and Graphs Basics/Week 4/5. Shortest Path on DAGs.mp4 17.1 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/8. Application # 1 Fast Polynomial Multiplication using FFT.mp4 13.3 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/1. What Are Divide and Conquer Algorithms.mp4 11.1 MB
3. Dynamic Programming, Greedy Algorithms/Week 1/FastFourierTransform.ipynb 6.8 MB
1/Week 4/ovRfLB10Q8u0XywddOPL7g_2f07a1b9931243ceb8289e924247c235_count-min-sketches.pdf 3.5 MB
1/Week 4/8dYkKltWSAyWJCpbVngMhQ_6595c98b71334fccbcfc88c4c7e926f4_string-matching-rabin-karp-scribbles.pdf 2.3 MB
1/Week 4/VVuQGd3MSNKbkBndzBjSmA_34a8ab8d201945fdae1e1f4cb5d89daa_bloom-filters-1.pdf 2.1 MB
1/Week 4/OAilEjknRImIpRI5J-SJKg_211383a521614320a0e1d8c71e251d2c_count-min-sketches.pdf 149.1 KB
1/Week 4/QXlfyz5JTLq5X8s-Sdy6Pg_f20f5b73ac8a49feb2bea7dfe86c8a96_bloom-filters.pdf 124.1 KB
1/Week 1/IthcSwTBS5SYXEsEwYuUug_2a37b826decb42ad982343140394391d_binarySearchLecture.pdf 95.6 KB
1/Week 1/2. An Introduction Through the Insertion Sort Algorithm.srt 64.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/5. FFT Part 1 Introduction and Complex Numbers.srt 63.2 KB
2. Trees and Graphs Basics/Week 3/5. Union-Find Data Structures and Rank Compression.srt 56.3 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/9. Grover's Search Algorithm.srt 52.6 KB
1/Week 4/2. Perfect hashing and Cuckoo hashing.srt 52.3 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/3. Karatsuba’s Multiplication Algorithm.srt 52.2 KB
1/Week 1/tINsz0vhQx2DbM9L4bMdqw_408b5978f7e14c33a00ba6c7bcdf4754_mergesort.pdf 51.9 KB
2. Trees and Graphs Basics/Week 4/2. Bellman-Ford Algorithm for Single Source Shortest Paths.srt 50.7 KB
2. Trees and Graphs Basics/Week 2/3. Depth First Search.srt 49.1 KB
1/Week 4/4. Count-Min Sketching Using Hashing.srt 47.9 KB
1/Week 1/6. Merge Sort Algorithm, Analysis and Proof of Correctness.srt 45.0 KB
2. Trees and Graphs Basics/Week 3/1. Amortized Analysis of Data Structures.srt 44.6 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/1. Decision Problems and Languages.srt 43.9 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/4. NP Completeness and Reductions.srt 43.5 KB
2. Trees and Graphs Basics/Week 1/5. Skip Lists.srt 43.1 KB
1/Week 1/4. Asymptotic Notation.srt 42.7 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/6. FFT Part 2 Definition and Interpretation of Discrete Fourier Transforms.srt 42.4 KB
1/Week 1/3. Time and Space Complexity.srt 42.3 KB
2. Trees and Graphs Basics/Week 3/2. Amortized Analysis Potential Functions.srt 41.6 KB
2. Trees and Graphs Basics/Week 4/6. All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm.srt 41.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/7. Qubits and Operations.srt 41.3 KB
2. Trees and Graphs Basics/Week 1/3. Red-Black Trees Basics.srt 40.7 KB
3. Dynamic Programming, Greedy Algorithms/Week 2/4. Knapsack Problem.srt 40.3 KB
2. Trees and Graphs Basics/Week 1/2. Binary Search Trees -- Insertion and Deletion.srt 40.1 KB
3. Dynamic Programming, Greedy Algorithms/Week 3/3. Prefix Codes.srt 39.6 KB
1/Week 3/4. Analysis of Quicksort Algorithm.srt 38.9 KB
1/Week 1/1. What is an Algorithm.srt 38.5 KB
2. Trees and Graphs Basics/Week 3/3. Spanning Trees and Minimal Spanning Trees with Applications.srt 37.7 KB
1/Week 3/6. Selecting Hash Functions.srt 37.4 KB
2. Trees and Graphs Basics/Week 4/1. Shortest Path Problems and Their Properties.srt 37.0 KB
1/Week 2/4. Priority Queues, Heapify, and Heapsort.srt 36.3 KB
1/Week 3/1. Introduction to Randomization + Average Case Analysis + Recurrences.srt 36.0 KB
2. Trees and Graphs Basics/Week 1/4. Red-Black Trees -- RotationsAlgorithms for Insertion (and Deletion).srt 35.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/6. Computation and Physics.srt 35.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 2/1. Introduction to Dynamic Programming + Rod Cutting Problem.srt 35.3 KB
1/Week 1/5. Binary Search.srt 35.2 KB
1/Week 2/3. Heap Primitives Bubble UpBubble Down.srt 34.8 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/3. NP Definition.srt 33.7 KB
3. Dynamic Programming, Greedy Algorithms/Week 2/2. Rod Cutting Problem Memoization.srt 33.6 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/2. Max Subarray Problem Using Divide and Conquer.srt 33.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/2. Polynomial Time Problems.srt 32.6 KB
1/Week 3/3. Detailed Design of Partitioning Schemes.srt 31.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 2/6. Dynamic Programming Longest Common Subsequence.srt 30.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/4. Master Method Revisited.srt 30.2 KB
3. Dynamic Programming, Greedy Algorithms/Week 3/2. Greedy Interval Scheduling.srt 29.9 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/5. NP Complete Problems Examples.srt 29.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 3/1. Introduction to Greedy Algorithms.srt 29.1 KB
1/Week 2/1. A Simple Data Structure The Dynamic Array.srt 28.0 KB
2. Trees and Graphs Basics/Week 1/1. Binary Search Trees -- Introduction and Properties.srt 27.9 KB
1/Week 2/5. Hashtables - Introduction.srt 27.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/7. FFT Part 3 Divide and Conquer Algorithm for FFT.srt 27.3 KB
1/Week 3/7. Universal Hash Functions and Analysis.srt 27.1 KB
1/Week 4/5. String Matching Using Hashing.srt 26.8 KB
1/Week 4/1. Open Address Hashing.srt 26.5 KB
1/Week 2/2. Heap, MinMax-Heaps and Properties of Heaps.srt 25.9 KB
3. Dynamic Programming, Greedy Algorithms/Week 4/8. Bell's Inequality.srt 24.5 KB
2. Trees and Graphs Basics/Week 2/6. Strongly Connected Components - Properties.srt 24.2 KB
3. Dynamic Programming, Greedy Algorithms/Week 3/5. Huffman Codes Proof of Optimality.srt 24.1 KB
1/Week 1/7. Pitfalls and Logarithms.srt 23.9 KB
1/Week 3/5. Quickselect Algorithm and its Applications.srt 23.2 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/9. Application # 2 Data Analysis using FFT.srt 23.2 KB
2. Trees and Graphs Basics/Week 2/7. Strongly Connected Components - Algorithm.srt 22.3 KB
2. Trees and Graphs Basics/Week 2/2. Graph Traversals and Breadth First Traversal.srt 22.0 KB
1/Week 4/3. Bloom Filters and Analysis.srt 21.9 KB
2. Trees and Graphs Basics/Week 4/3. Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights.srt 21.4 KB
1/Week 3/2. Partition and Quicksort Algorithm.srt 21.1 KB
2. Trees and Graphs Basics/Week 2/5. Strongly Connected Components - Definitions.srt 20.0 KB
2. Trees and Graphs Basics/Week 2/1. Graphs and Their Representations.srt 18.2 KB
3. Dynamic Programming, Greedy Algorithms/Week 2/3. Coin Changing Problem.srt 17.6 KB
1/Week 1/QWMV-nQQRVujFfp0EPVbjg_4e706aac6dcc406db9d7c05c1bbdc581_BinarySearch---Notes.json 14.9 KB
3. Dynamic Programming, Greedy Algorithms/Week 3/4. Huffman Codes.srt 14.8 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/Karatsuba Multiplication Algorithm.ipynb 14.6 KB
2. Trees and Graphs Basics/Week 4/4. Proof of Dijkstra's Algorithm.srt 14.4 KB
3. Dynamic Programming, Greedy Algorithms/Week 2/5. When Optimal Substructure Fails.srt 14.3 KB
2. Trees and Graphs Basics/Week 2/4. Topological Sorting and Applications.srt 14.3 KB
1/Week 1/BNDFacHNTJiQxWnBzdyYsg_7b927f7ea2d044b59cd733ab9ddbd36a_Mergesort---Notes.json 12.9 KB
2. Trees and Graphs Basics/Week 4/5. Shortest Path on DAGs.srt 12.8 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/1. What Are Divide and Conquer Algorithms.srt 12.2 KB
2. Trees and Graphs Basics/Week 3/4. Kruskal’s Algorithm for Finding Minimal Spanning Trees.srt 11.2 KB
3. Dynamic Programming, Greedy Algorithms/Week 1/8. Application # 1 Fast Polynomial Multiplication using FFT.srt 9.4 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

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

File List

Download Torrent

Related Resources

Copyright Infringement