Coursera Algorithm Design Analysis | D7BDB6A29702CB5B6E2B082BA08410247A3689B0

Coursera Algorithm Design Analysis

Name	Coursera- Algorithm Design & Analysis 1	DOWNLOAD Copy Link
Total Size	1.5 GB
Total Files	149
Hash	D7BDB6A29702CB5B6E2B082BA08410247A3689B0

/
1 - 1 - Why Study Algorithms _ (4 min).mp4	8.4 MB
1 - 2 - Integer Multiplication (9 min).mp4	17.7 MB
1 - 3 - Karatsuba Multiplication (13 min).mp4	22.7 MB
1 - 4 - About the Course (17 min).mp4	18.2 MB
1 - 5 - Merge Sort_ Motivation and Example (9 min).mp4	11.2 MB
1 - 6 - Merge Sort_ Pseudocode (13 min).mp4	15.7 MB
1 - 7 - Merge Sort_ Analysis (9 min).mp4	11.9 MB
1 - 8 - Guiding Principles for Analysis of Algorithms (15 min).mp4	18.9 MB
10 - 1 - Graph Search - Overview (23 min).mp4	24.4 MB
10 - 2 - Breadth-First Search (BFS)_ The Basics (14 min).mp4	15.0 MB
10 - 3 - BFS and Shortest Paths (8 min).mp4	8.3 MB
10 - 4 - BFS and Undirected Connectivity (13 min).mp4	14.4 MB
10 - 5 - Depth-First Search (DFS)_ The Basics (7 min).mp4	7.5 MB
10 - 6 - Topological Sort (22 min).mp4	23.2 MB
10 - 7 - Computing Strong Components_ The Algorithm (29 min).mp4	30.9 MB
10 - 8 - Computing Strong Components_ The Analysis (26 min).mp4	28.1 MB
10 - 9 - Structure of the Web [Optional] (19 min).mp4	19.5 MB
11 - 1 - Dijkstra_'s Shortest-Path Algorithm (21 min).mp4	22.0 MB
11 - 2 - Dijkstra_'s Algorithm_ Examples (13 min).mp4	13.5 MB
11 - 3 - Correctness of Dijkstra_'s Algorithm [Advanced - Optional] (19 min).mp4	21.3 MB
11 - 4 - Dijkstra_'s Algorithm_ Implementation and Running Time (26 min).mp4	27.7 MB
12 - 1 - Data Structures_ Overview (5 min).mp4	4.9 MB
12 - 2 - Heaps_ Operations and Applications (18 min).mp4	19.5 MB
12 - 3 - Heaps_ Implementation Details [Advanced - Optional] (21 min).mp4	21.9 MB
13 - 1 - Balanced Search Trees_ Operations and Applications (11 min).mp4	11.5 MB
13 - 2 - Binary Search Tree Basics, Part I (13 min).mp4	13.9 MB
13 - 3 - Binary Search Tree Basics, Part II (30 min).mp4	31.4 MB
13 - 4 - Red-Black Trees (21 min).mp4	22.9 MB
13 - 5 - Rotations [Advanced - Optional] (8 min).mp4	10.8 MB
13 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp4	21.8 MB
14 - 1 - Hash Tables_ Operations and Applications (19 min).mp4	20.7 MB
14 - 2 - Hash Tables_ Implementation Details, Part I (19 min).mp4	20.8 MB
14 - 3 - Hash Tables_ Implementation Details, Part II (22 min).mp4	23.6 MB
15 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp4	23.6 MB
15 - 2 - Universal Hashing_ Definition and Example [Advanced - Optional] (26 min).mp4	27.4 MB
15 - 3 - Universal Hashing_ Analysis of Chaining [Advanced - Optional] (19 min).mp4	19.4 MB
15 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).mp4	16.4 MB
16 - 1 - Bloom Filters_ The Basics (16 min).mp4	16.2 MB
16 - 2 - Bloom Filters_ Heuristic Analysis (13 min).mp4	14.2 MB
17 - 1 - Application_ Internet Routing [Optional] (11 min).mp4	14.5 MB
17 - 2 - Application_ Sequence Alignment [Optional] (9 min).mp4	11.6 MB
17 - 3 - Introduction to Greedy Algorithms [Optional] (13 min).mp4	18.9 MB
17 - 4 - Huffman Codes_ Introduction and Motivation [Optional] (9 min).mp4	12.5 MB
17 - 5 - Principles of Dynamic Programming [Optional] (8 min).mp4	12.9 MB
17 - 6 - The P vs. NP Question [Optional] (9 min).mp4	15.0 MB
17 - 7 - Algorithmic Approaches to NP-Complete Problems [Optional] (13 min).mp4	20.8 MB
2 - 1 - The Gist (14 min).mp4	29.0 MB
2 - 2 - Big-Oh Notation (4 min).mp4	4.3 MB
2 - 3 - Basic Examples (7 min).mp4	7.7 MB
2 - 4 - Big Omega and Theta (7 min).mp4	7.9 MB
2 - 5 - Additional Examples [Review - Optional] (8 min).mp4	8.1 MB
3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp4	13.5 MB
3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp4	18.0 MB
3 - 3 - Strassen_'s Subcubic Matrix Multiplication Algorithm (22 min).mp4	24.7 MB
3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp4	38.0 MB
3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp4	21.1 MB
4 - 1 - Motivation (8 min).mp4	8.7 MB
4 - 2 - Formal Statement (10 min).mp4	10.9 MB
4 - 3 - Examples (13 min).mp4	15.1 MB
4 - 4 - Proof I (10 min).mp4	12.0 MB
4 - 5 - Interpretation of the 3 Cases (11 min).mp4	13.8 MB
4 - 6 - Proof II (16 min).mp4	17.4 MB
5 - 1 - Quicksort_ Overview (12 min).mp4	12.8 MB
5 - 2 - Partitioning Around a Pivot (25 min).mp4	26.1 MB
5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp4	12.4 MB
5 - 4 - Choosing a Good Pivot (22min).mp4	28.9 MB
6 - 1 - Analysis I_ A Decomposition Principle [Advanced - Optional] (22 min).mp4	22.7 MB
6 - 2 - Analysis II_ The Key Insight [Advanced - Optional] (12min).mp4	12.6 MB
6 - 3 - Analysis III_ Final Calculations [Advanced - Optional] (9min).mp4	9.4 MB
7 - 1 - Part I [Review - Optional] (25 min).mp4	26.7 MB
7 - 2 - Part II [Review - Optional] (17 min).mp4	18.1 MB
8 - 1 - Randomized Selection - Algorithm (22 min).mp4	22.4 MB
8 - 2 - Randomized Selection - Analysis (21 min).mp4	21.6 MB
8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp4	18.4 MB
8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp4	23.9 MB
8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp4	13.5 MB
8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).mp4	14.3 MB
9 - 1 - Graphs and Minimum Cuts (16 min).mp4	15.9 MB
9 - 2 - Graph Representations (14 min).mp4	16.4 MB
9 - 3 - Random Contraction Algorithm (9 min).mp4	8.7 MB
9 - 4 - Analysis of Contraction Algorithm (30 min).mp4	31.3 MB
9 - 5 - Counting Minimum Cuts (7 min).mp4	7.8 MB
algo-about_typed.pdf	749.0 KB
algo-asymptotic1_typed.pdf	831.5 KB
algo-asymptotic2_typed.pdf	345.7 KB
algo-asymptotic3_typed.pdf	1.0 MB
algo-asymptotic4_typed.pdf	842.1 KB
algo-closest1_typed.pdf	2.2 MB
algo-closest2_typed.pdf	4.1 MB
algo-dijkstra-basics_typed.pdf	443.1 KB
algo-dijkstra-correctness_typed.pdf	444.3 KB
algo-dijkstra-runtime_typed.pdf	453.6 KB
algo-ds-bloom-typed.pdf	190.3 KB
algo-ds-hash-basics_typed.pdf	229.0 KB
algo-ds-hash-guts_typed.pdf	1.7 MB
algo-ds-hash-universal-2_typed.pdf	790.4 KB
algo-ds-hash-universal1-typed.pdf	125.1 KB
algo-ds-hash-universal3-typed.pdf	378.6 KB
algo-ds-hash-universal4-typed.pdf	156.1 KB
algo-ds-heaps-basics_typed.pdf	226.2 KB
algo-ds-heaps-guts_typed.pdf	1.1 MB
algo-ds-overview_typed.pdf	197.5 KB
algo-ds-trees-basics-typed.pdf	468.5 KB
algo-ds-trees-ops-typed.pdf	125.5 KB
algo-ds-trees-redblack-typed.pdf	252.6 KB
algo-graphs-bfs_typed.pdf	2.8 MB
algo-graphs-dfs_typed.pdf	2.2 MB
algo-graphs-scc_typed.pdf	1.6 MB
algo-graphs-sccanalysis_typed.pdf	473.5 KB
algo-graphs-search_typed.pdf	2.1 MB
algo-graphs-web_typed.pdf	251.4 KB
algo-guiding_typed.pdf	567.3 KB
algo-inversions1_typed.pdf	937.1 KB
algo-inversions2_typed.pdf	463.2 KB
algo-karger-algorithm_typed.pdf	641.9 KB
algo-karger-analysis_typed.pdf	628.0 KB
algo-karger-counting_typed.pdf	286.2 KB
algo-karger-overview_typed.pdf	508.6 KB
algo-karger-representations_typed.pdf	472.4 KB
algo-master1_typed.pdf	467.6 KB
algo-master2_typed.pdf	370.9 KB
algo-master3_typed.pdf	875.7 KB
algo-master4_typed.pdf	967.0 KB
algo-master5_typed.pdf	283.6 KB
algo-master6_typed.pdf	845.5 KB
algo-merge1_typed.pdf	713.9 KB
algo-merge2_typed.pdf	679.8 KB
algo-merge3_typed.pdf	737.8 KB
algo-prob_review1_typed.pdf	1.6 MB
algo-prob_review2_typed.pdf	1.3 MB
algo-qsort-analysis1_typed.pdf	1.5 MB
algo-qsort-analysis2_typed.pdf	308.6 KB
algo-qsort-analysis3_typed.pdf	1.0 MB
algo-qsort-correctness_typed.pdf	1.1 MB
algo-qsort-intro_typed.pdf	1.4 MB
algo-qsort-partition_typed.pdf	4.1 MB
algo-qsort-pivot_typed.pdf	1.5 MB
algo-select-dalgorithm_typed.pdf	1.8 MB
algo-select-danalysis2_typed.pdf	312.6 KB
algo-select-danalysis_typed.pdf	2.3 MB
algo-select-ralgorithm_typed.pdf	2.0 MB
algo-select-ranalysis_typed.pdf	2.1 MB
algo-select-sortinglb_typed.pdf	276.5 KB
algo-strassen_typed.pdf	1.9 MB
algo1-aa-gist_typed.pdf	280.0 KB
algo1-intro2_typed.pdf	625.6 KB
algo1-intro3_typed.pdf	693.4 KB
redblack1_typed.pdf	103.2 KB
redblack2_typed.pdf	111.6 KB
Total files 149