Coursera Algorithms part Preview 2012 | 9DBD15AB9465419678C38CD345CE5383582FF3F8

Coursera Algorithms part Preview 2012

Name	Coursera - Algorithms part 2 [Preview] (2012)	DOWNLOAD Copy Link Trouble downloading? see How To
Total Size	1.6 GB
Total Files	204
Hash	9DBD15AB9465419678C38CD345CE5383582FF3F8

/video/
9 - 3 - A Greedy Algorithm (17 min) [16506eac] .mp4	25.9 MB
18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min) [df597ad8] .mp4	16.1 MB
14 - 3 - The Basic Algorithm I (9 min) [2b42b24d] .mp4	12.7 MB
19 - 5 - The 2-SAT Problem (15 min) [9aa7a458] .mp4	20.6 MB
16 - 5 - The P vs. NP Question (9 min) [18428f98] .mp4	15.0 MB
15 - 6 - Johnson's Algorithm II (11 min) [0388fabb] .mp4	17.7 MB
8 - 3 - Analysis of Union-by-Rank (15 min) [40e822a2] .mp4	23.4 MB
2 - 8 - Data Structures Overview (5 min) [2f97a690] .mp4	5.1 MB
17 - 4 - The Traveling Salesman Problem (15 min) [d5b10502] .mp4	22.0 MB
15 - 4 - A Reweighting Technique (14 min) [17e57ff9] .mp4	20.6 MB
18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min) [fb7276e9] .mp4	19.7 MB
19 - 6 - Random Walks on a Line (16 min) [ca621623] .mp4	22.4 MB
17 - 2 - Smarter Search for Vertex Cover I (10 min) [fb8d1d6a] .mp4	14.8 MB
14 - 7 - Internet Routing I (11 min) [2b9cdca2] .mp4	17.5 MB
7 - 1 - Application to Clustering (12 min) [41211bfd] .mp4	15.9 MB
16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min) [f35b5954] .mp4	20.8 MB
20 - 1 - Stable Matching (15 min) [d1eea025] .mp4	23.6 MB
17 - 3 - Smarter Search for Vertex Cover II (8 min) [8362ddf6] .mp4	10.9 MB
17 - 5 - A Dynamic Programming Algorithm for TSP (12 min) [d3810dbe] .mp4	18.3 MB
6 - 2- Correctness of Kruskal's Algorithm (9 min) [0ce1ddba] .mp4	12.9 MB
1 - 1 - Application Internet Routing (11 min) [6cb92f13] .mp4	14.5 MB
6 - 1 - Kruskal's MST Algorithm (8 min) [45de840f] .mp4	11.6 MB
2 - 3 - Guiding Principles for Analysis of Algorithms (15 min) [855b56f0] .mp4	19.8 MB
12 - 1 - Optimal Substructure (14 min) [207bb803] .mp4	20.5 MB
19 - 2 - The Maximum Cut Problem II (9 min) [42285a8b] .mp4	13.5 MB
10 - 5 - Principles of Dynamic Programming (8 min) [7ac867a4] .mp4	12.9 MB
14 - 2 - Optimal Substructure (11 min) [2b8608e6] .mp4	16.0 MB
4 - 3 - Correctness Proof - Part I (7 min) [b56d6c56] .mp4	9.7 MB
18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min) [f1139873] .mp4	13.9 MB
10 - 1 - Introduction - Weighted Independent Sets in Path Graphs (8 min) [65fbd448] .mp4	11.8 MB
17 - 1 - The Vertex Cover Problem (9 min) [abd9c177].mp4	13.4 MB
9 - 5 - Correctness Proof II (13 min) [5a973fb7] .mp4	17.6 MB
13 - 2 - Optimal Substructure (9 min) [239442ab] .mp4	14.6 MB
10 - 4 - WIS in Path Graphs - A Reconstruction Algorithm (7 min) [b977a9ca] .mp4	10.1 MB
16 - 4 - Definition and Interpretation of NP-Completeness II (8 min) [c332ad52] .mp4	12.8 MB
13 - 5 - A Dynamic Programming Algorithm II (9 min) [8726ac90] .mp4	12.5 MB
5 - 6 - Fast Implementation I (15 min) [351642eb] .mp4	20.6 MB
15 - 2 - Optimal Substructure (12 min) [0fd68539] .mp4	17.3 MB
8 - 1 - Lazy Unions (10 min) [c45fabb9] .mp4	16.0 MB
11 - 1 - The Knapsack Problem (9 min) [319dc01b] .mp4	14.8 MB
2 - 5 - Graph Representations (14 min) [2d064709] .mp4	15.2 MB
16 - 1 - Polynomial-Time Solvable Problems (14 min) [77e7a40c] .mp4	21.5 MB
8 - 4 - Path Compression (15 min) [f168bafc] .mp4	22.6 MB
10 - 3 - WIS in Path Graphs - A Linear-Time Algorithm (10 min) [0148f8b6] .mp4	15.2 MB
3 - 1 - Introduction to Greedy Algorithms (13 min) [79a25644] .mp4	18.9 MB
5 - 2 - Prim's MST Algorithm (8 min) [5df4b92e] .mp4	10.5 MB
4 - 4 - Correctness Proof - Part II (5 min) [ddab0f06] .mp4	6.5 MB
2 - 4 - Big-Oh Notation (4 min) [438918e9] .mp4	4.6 MB
6 - 3 - Implementing Kruskal's Algorithm via Union-Find I (9 min) [f2558f1a] .mp4	13.5 MB
14 - 6 - A Space Optimization (12 min) [11984b71] .mp4	19.2 MB
20 - 3 - Linear Programming and Beyond (11 min) [b683a60d] .mp4	17.7 MB
5 - 3 - Correctness Proof I (16 min) [f9f5f689] .mp4	19.9 MB
2 - 9 - Heaps Operations and Applications (18 min) [ab64ebe3] .mp4	20.4 MB
19 - 4 - Principles of Local Search II (10 min) [26a835d8] .mp4	15.2 MB
11 - 2 - A Dynamic Programming Algorithm (9 min) [55792123] .mp4	14.3 MB
4 - 1 - Problem Definition (6 min) [2b4ea5b2] .mp4	8.2 MB
20 - 4 - Epilogue (1 min) [a66483a8] .mp4	1.9 MB
8 - 8 - Tarjan's Analysis I (14 min) [8fb3c716] .mp4	21.8 MB
5 - 7 - Fast Implementation II (10 min) [1c4bd5f8] .mp4	13.8 MB
9 - 1 - Introduction and Motivation (9 min) [c3fa5362] .mp4	12.5 MB
16 - 3 - Definition and Interpretation of NP-Completeness I (11 min) [6e11daca] .mp4	17.1 MB
14 - 8 - Internet Routing II (7 min) [01894cec] .mp4	11.2 MB
4 - 2 - A Greedy Algorithm (13 min) [2974e0a3] .mp4	18.0 MB
13 - 3 - Proof of Optimal Substructure (7 min) [7eadf7bc] .mp4	10.3 MB
16 - 2 - Reductions and Completeness (14 min) [ae15d261] .mp4	20.8 MB
8 - 6 - The Hopcroft-Ullman Analysis II (12 min) [6dd9994f] .mp4	18.0 MB
15 - 3 - The Floyd-Warshall Algorithm (13 min) [ee779bb2] .mp4	19.8 MB
15 - 1 - Problem Definition (7 min) [2956c05c] .mp4	9.9 MB
2 - 6 - Graph Search - Overview (23 min) [e49996be] .mp4	25.5 MB
12 - 2 - A Dynamic Programming Algorithm (12 min) [835dbf7e] .mp4	17.5 MB
9 - 2 - Problem Definition (10 min) [a45565a8] .mp4	16.1 MB
18 - 1 - A Greedy Knapsack Heuristic (14 min) [2b78339f].mp4	19.7 MB
8 - 9 - Tarjan's Analysis II (14 min) [f4ca2e27] .mp4	20.0 MB
8 - 5 - The Hopcroft-Ullman Analysis I (9 min) [9d26faef] .mp4	14.3 MB
2 - 7 - Dijkstras Shortest-Path Algorithm (21 min) [cbc12e6c] .mp4	23.0 MB
14 - 4 - The Basic Algorithm II (11 min) [67091f5b] .mp4	14.3 MB
5 - 5 - Proof of Cut Property (12 min) [bf1a2bfb] .mp4	15.7 MB
13 - 4 - A Dynamic Programming Algorithm I (10 min) [d8ef4cfe] .mp4	14.7 MB
5 - 4 - Correctness Proof II (8 min) [d5005e55] .mp4	10.6 MB
9 - 4 - Correctness Proof I (10 min) [9340eb0d] .mp4	14.0 MB
19 - 7 - Analysis of Papadimitriou's Algorithm (15 min) [0723a39a] .mp4	22.9 MB
2 - 1 - About the Course (17 min) [048ca5a3] .mp4	19.2 MB
13 - 1 - Problem Definition (12 min) [ccba5e58] .mp4	18.0 MB
6 - 4 - Implementing Kruskal's Algorithm via Union-Find II (14 min) [6d0f84e6] .mp4	19.8 MB
4 - 5 - Handling Ties (7 min) [36e04b70] .mp4	10.1 MB
14 - 1 - Single-Source Shortest Paths, Revisted (11 min) [271afebc] .mp4	15.9 MB
20 - 2 - Matchings, Flows, and Braess's Paradox (14 min) [1b92a84b] .mp4	22.0 MB
6 - 5 - MSTs- State-of-the-Art and Open Questions (9 min) [8b682c9d] .mp4	14.9 MB
3 - 2 - Application Optimal Caching (11 min) [cfe3f405] .mp4	15.7 MB
19 - 3 - Principles of Local Search I (9 min) [f7127cf0] .mp4	12.8 MB
8 - 2 - Union-by-Rank (12 min) [324f41a7] .mp4	19.1 MB
15 - 5 - Johnson's Algorithm I (11 min) [4a33d6c3] .mp4	16.2 MB
18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min) [afec9276] .mp4	9.4 MB
8 - 7 - The Ackermann Function (16 min) [82173278] .mp4	23.7 MB
5 - 1 - MST Problem Definition (11 min) [3682c182] .mp4	15.7 MB
1 - 2 - Application Sequence Alignment (9 min) [722963dd] .mp4	11.6 MB
7 - 2 - Correctness of Clustering Algorithm (10 min) [50b9b028] .mp4	12.5 MB
10 - 2 - WIS in Path Graphs - Optimal Substructure (9 min) [589175a6] .mp4	14.2 MB
14 - 5 - Detecting Negative Cycles (9 min) [15b99fd4] .mp4	13.4 MB
19 - 1 - The Maximum Cut Problem I (9 min) [f813dd7f] .mp4	13.0 MB
2 - 2 - Introduction Why Study Algorithms (19 min) [aabee07c] .mp4	21.2 MB
18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min) [bf43806e] .mp4	13.0 MB
/subtitles/
5 - 1 - MST Problem Definition (11 min).srt	18.6 KB
2 - 5 - Graph Representations [Part I Review - Optional] (14 min).srt	24.3 KB
17 - 3 - Smarter Search for Vertex Cover II (8 min).srt	11.7 KB
17 - 2 - Smarter Search for Vertex Cover I (10 min).srt	14.4 KB
20 - 3 - Linear Programming and Beyond [Optional] (11 min).srt	17.5 KB
4 - 4 - Correctness Proof - Part II (5 min).srt	7.1 KB
20 - 2 - Matchings Flows and Braesss Paradox [Optional] (14 min).srt	20.3 KB
2 - 9 - Heaps Operations and Applications [Part I Review - Optional] (18).srt	30.7 KB
19 - 5 - The 2-SAT Problem (15 min).srt	22.9 KB
5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).srt	19.9 KB
8 - 6 - Correctness Proof II (13 min).srt	21.4 KB
10 - 2 - A Dynamic Programming Algorithm (10 min).srt	15.2 KB
7 - 6 - Path Compression The Hopcroft-Ullman Analysis II [Advanced - Optional].srt	17.7 KB
9 - 5 - Principles of Dynamic Programming (8 min).srt	12.7 KB
2 - 2 - Why Study Algorithms [Part I Review - Optional] (19 min).srt	29.9 KB
18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).srt	18.0 KB
15 - 1 - Problem Definition (7 min).srt	11.4 KB
7 - 7 - The Ackermann Function [Advanced - Optional](17 min).srt	22.3 KB
12 - 1 - Optimal Substructure (14 min).srt	21.6 KB
19 - 1 - The Maximum Cut Problem I (9 min).srt	13.0 KB
15 - 6 - Johnsons Algorithm II (11 min).srt	17.3 KB
1 - 2 - Application Sequence Alignment (9 min).srt	13.7 KB
17 - 1 - The Vertex Cover Problem (9 min).srt	13.7 KB
3 - 2 - Application Optimal Caching (11 min).srt	17.4 KB
19 - 4 - Principles of Local Search II (10 min).srt	18.1 KB
16 - 2 - Reductions and Completeness (14 min).srt	20.4 KB
7 - 4 - Path Compression [Advanced - Optional] (15).srt	22.6 KB
8 - 2 - Problem Definition (10 min).srt	15.9 KB
4 - 1 - Problem Definition (6 min).srt	10.3 KB
9 - 4 - WIS in Path Graphs A Reconstruction Algorithm (7 min).srt	11.3 KB
4 - 5 - Handling Ties [Advanced - Optional] (7 min).srt	12.0 KB
20 - 1 - Stable Matching [Optional] (15 min).srt	20.4 KB
7 - 2 - Union-by-Rank [Advanced - Optional] (12 min).srt	20.2 KB
5 - 6 - Fast Implementation I (15 min).srt	24.0 KB
14 - 2 - Optimal Substructure (11 min).srt	16.9 KB
7 - 3 - Analysis of Union-by-Rank [Advanced - Optional](15).srt	23.1 KB
3 - 1 - Introduction to Greedy Algorithms (13 min).srt	22.3 KB
20 - 4 - Epilogue (1 min).srt	1.9 KB
13 - 3 - Proof of Optimal Substructure (7 min).srt	9.9 KB
6 - 2 - Correctness of Kruskals Algorithm (9 min).srt	15.3 KB
7 - 9 - Path Compression Tarjans Analysis II [Advanced - Optional].srt	20.2 KB
18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).srt	21.8 KB
8 - 5 - Correctness Proof I (10 min).srt	16.1 KB
2 - 8 - Data Structures Overview [Part I Review - Optional] (5).srt	7.7 KB
8 - 3 - A Greedy Algorithm (17 min).srt	27.0 KB
5 - 7 - Fast Implementation II (10 min).srt	15.7 KB
5 - 2 - Prims MST Algorithm (8 min).srt	13.0 KB
18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).srt	15.5 KB
2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).srt	6.9 KB
5 - 3 - Correctness Proof I (16 min).srt	24.1 KB
13 - 4 - A Dynamic Programming Algorithm I (10 min).srt	16.7 KB
19 - 6 - Random Walks on a Line (16 min).srt	24.8 KB
6 - 1 - Kruskals MST Algorithm (8 min).srt	13.6 KB
16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).srt	20.9 KB
12 - 2 - A Dynamic Programming Algorithm (12 min).srt	19.6 KB
16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).srt	16.1 KB
18 - 5 - Knapsack via Dynamic Programming Revisited (10 min).srt	15.9 KB
2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).srt	25.9 KB
14 - 4 - The Basic Algorithm II (11 min).srt	16.4 KB
18 - 1 - A Greedy Knapsack Heuristic (14 min).srt	21.7 KB
2 - 7 - Dijkstras Shortest-Path Algorithm [Part I Review - Optional] (21 min).srt	34.5 KB
2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).srt	41.1 KB
11 - 2 - Correctness of Clustering Algorithm (10 min).srt	16.8 KB
15 - 3 - The Floyd-Warshall Algorithm (13 min).srt	22.2 KB
16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).srt	11.9 KB
6 - 4 - Implementing Kruskals Algorithm via Union-Find II (14 min).srt	23.1 KB
19 - 2 - The Maximum Cut Problem II (9 min).srt	15.0 KB
14 - 5 - Detecting Negative Cycles (9 min).srt	14.7 KB
5 - 4 - Correctness Proof II (8 min).srt	13.0 KB
17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).srt	18.4 KB
2 - 1 - About the Course [Part I Review - Optional] (17 min).srt	32.1 KB
19 - 3 - Principles of Local Search I (9 min).srt	14.8 KB
14 - 3 - The Basic Algorithm I (9 min).srt	12.8 KB
15 - 4 - A Reweighting Technique (14 min).srt	21.1 KB
16 - 5 - The P vs. NP Question (9 min).srt	13.5 KB
14 - 7 - Internet Routing I [Optional] (11 min).srt	19.4 KB
4 - 2 - A Greedy Algorithm (13 min).srt	22.5 KB
7 - 5 - Path Compression The Hopcroft-Ullman Analysis I [Advanced - Optional].srt	14.5 KB
13 - 5 - A Dynamic Programming Algorithm II (9 min).srt	15.8 KB
14 - 8 - Internet Routing II [Optional] (7 min).srt	11.4 KB
14 - 1 - Single-Source Shortest Paths Revisted (11 min).srt	17.9 KB
15 - 5 - Johnsons Algorithm I (11 min).srt	16.0 KB
19 - 7 - Analysis of Papadimitrious Algorithm (15 min).srt	22.0 KB
13 - 2 - Optimal Substructure (9 min).srt	15.9 KB
8 - 1 - Introduction and Motivation (9 min).srt	14.7 KB
9 - 1 - Introduction Weighted Independent Sets in Path Graphs (8 min).srt	13.4 KB
14 - 6 - A Space Optimization (12 min).srt	19.1 KB
17 - 4 - The Traveling Salesman Problem (15 min).srt	23.7 KB
11 - 1 - Application to Clustering (12 min).srt	18.9 KB
7 - 1 - Lazy Unions [Advanced - Optional] (10 min).srt	16.4 KB
9 - 3 - WIS in Path Graphs A Linear-Time Algorithm (10 min).srt	15.9 KB
13 - 1 - Problem Definition (12 min).srt	20.7 KB
6 - 3 - Implementing Kruskals Algorithm via Union-Find I (9 min).srt	16.1 KB
7 - 8 - Path Compression Tarjans Analysis I [Advanced - Optional].srt	21.7 KB
1 - 1 - Application Internet Routing (11 min).srt	18.2 KB
16 - 1 - Polynomial-Time Solvable Problems (14 min).srt	21.9 KB
6 - 5 - MSTs State-of-the-Art and Open Questions [Advanced - Optional] (9 min).srt	15.3 KB
10 - 1 - The Knapsack Problem (10 min).srt	14.8 KB
15 - 2 - Optimal Substructure (12 min).srt	20.2 KB
18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).srt	10.4 KB
4 - 3 - Correctness Proof - Part I (7 min).srt	11.9 KB
9 - 2 - WIS in Path Graphs Optimal Substructure (9 min).srt	13.9 KB
Total files 204