FileMood

Download Coursera- Algorithm Design & Analysis 2

Coursera Algorithm Design Analysis

Name

Coursera- Algorithm Design & Analysis 2

  DOWNLOAD Copy Link

Trouble downloading? see How To

Total Size

1.8 GB

Total Files

187

Hash

2DE8E0D6399C1794E90E771F4E5F86CA2994AA72

/

1 - 1 - Application_ Internet Routing (11 min).mp4

14.5 MB

1 - 2 - Application_ Sequence Alignment (9 min).mp4

11.6 MB

10 - 1 - Introduction_ Weighted Independent Sets in Path Graphs (8 min).mp4

11.8 MB

10 - 2 - WIS in Path Graphs_ Optimal Substructure (9 min).mp4

14.2 MB

10 - 3 - WIS in Path Graphs_ A Linear-Time Algorithm (10 min).mp4

15.2 MB

10 - 4 - WIS in Path Graphs_ A Reconstruction Algorithm (7 min).mp4

10.1 MB

10 - 5 - Principles of Dynamic Programming (8 min).mp4

12.9 MB

11 - 1 - The Knapsack Problem (10 min).mp4

14.8 MB

11 - 2 - A Dynamic Programming Algorithm (10 min).mp4

14.3 MB

12 - 1 - Optimal Substructure (14 min).mp4

20.5 MB

12 - 2 - A Dynamic Programming Algorithm (12 min).mp4

17.5 MB

13 - 1 - Problem Definition (12 min).mp4

18.0 MB

13 - 2 - Optimal Substructure (9 min).mp4

14.6 MB

13 - 3 - Proof of Optimal Substructure (7 min).mp4

10.3 MB

13 - 4 - A Dynamic Programming Algorithm I (10 min).mp4

14.7 MB

13 - 5 - A Dynamic Programming Algorithm II (9 min).mp4

12.5 MB

14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp4

15.9 MB

14 - 2 - Optimal Substructure (11 min).mp4

16.0 MB

14 - 3 - The Basic Algorithm I (9 min).mp4

12.7 MB

14 - 4 - The Basic Algorithm II (11 min).mp4

14.3 MB

14 - 5 - Detecting Negative Cycles (9 min).mp4

13.4 MB

14 - 6 - A Space Optimization (12 min).mp4

19.2 MB

14 - 7 - Internet Routing I [Optional] (11 min).mp4

17.5 MB

14 - 8 - Internet Routing II [Optional] (7 min).mp4

11.2 MB

15 - 1 - Problem Definition (7 min).mp4

9.9 MB

15 - 2 - Optimal Substructure (12 min).mp4

17.3 MB

15 - 3 - The Floyd-Warshall Algorithm (13 min).mp4

19.8 MB

15 - 4 - A Reweighting Technique (14 min).mp4

20.6 MB

15 - 5 - Johnson_'s Algorithm I (11 min).mp4

16.2 MB

15 - 6 - Johnson_'s Algorithm II (11 min).mp4

17.7 MB

16 - 1 - Polynomial-Time Solvable Problems (14 min).mp4

21.5 MB

16 - 2 - Reductions and Completeness (14 min).mp4

20.8 MB

16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp4

17.1 MB

16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp4

12.8 MB

16 - 5 - The P vs. NP Question (9 min).mp4

15.0 MB

16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp4

20.8 MB

17 - 1 - The Vertex Cover Problem (9 min).mp4

13.4 MB

17 - 2 - Smarter Search for Vertex Cover I (10 min).mp4

14.8 MB

17 - 3 - Smarter Search for Vertex Cover II (8 min).mp4

10.9 MB

17 - 4 - The Traveling Salesman Problem (15 min).mp4

22.0 MB

17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp4

18.3 MB

18 - 1 - A Greedy Knapsack Heuristic (14 min).mp4

19.7 MB

18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp4

9.4 MB

18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp4

13.0 MB

18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp4

16.2 MB

18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min).mp4

13.9 MB

18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp4

19.6 MB

19 - 1 - The Maximum Cut Problem I (9 min).mp4

13.0 MB

19 - 2 - The Maximum Cut Problem II (9 min).mp4

13.5 MB

19 - 3 - Principles of Local Search I (9 min).mp4

12.8 MB

19 - 4 - Principles of Local Search II (10 min).mp4

15.2 MB

19 - 5 - The 2-SAT Problem (15 min).mp4

20.6 MB

19 - 6 - Random Walks on a Line (16 min).mp4

22.4 MB

19 - 7 - Analysis of Papadimitriou_'s Algorithm (15 min).mp4

22.7 MB

2 - 1 - About the Course [Part I Review - Optional] (17 min).mp4

19.2 MB

2 - 2 - Why Study Algorithms_ [Part I Review - Optional] (19 min).mp4

21.2 MB

2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4

19.8 MB

2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp4

4.6 MB

2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp4

15.2 MB

2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp4

25.5 MB

2 - 7 - Dijkstra_'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4

23.0 MB

2 - 8 - Data Structures_ Overview [Part I Review - Optional] (5).mp4

5.1 MB

2 - 9 - Heaps_ Operations and Applications [Part I Review - Optional] (18).mp4

20.4 MB

20 - 1 - Stable Matching [Optional] (15 min).mp4

23.6 MB

20 - 2 - Matchings, Flows, and Braess_'s Paradox [Optional] (14 min).mp4

22.0 MB

20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp4

17.7 MB

20 - 4 - Epilogue (1 min).mp4

1.9 MB

3 - 1 - Introduction to Greedy Algorithms (13 min).mp4

18.9 MB

3 - 2 - Application_ Optimal Caching (11 min).mp4

15.7 MB

4 - 1 - Problem Definition (6 min).mp4

8.2 MB

4 - 2 - A Greedy Algorithm (13 min).mp4

18.0 MB

4 - 3 - Correctness Proof - Part I (7 min).mp4

9.7 MB

4 - 4 - Correctness Proof - Part II (5 min).mp4

6.5 MB

4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp4

10.1 MB

5 - 1 - MST Problem Definition (11 min).mp4

15.7 MB

5 - 2 - Prim_'s MST Algorithm (8 min).mp4

10.5 MB

5 - 3 - Correctness Proof I (16 min).mp4

19.9 MB

5 - 4 - Correctness Proof II (8 min).mp4

10.6 MB

5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp4

15.7 MB

5 - 6 - Fast Implementation I (15 min).mp4

20.6 MB

5 - 7 - Fast Implementation II (10 min).mp4

13.8 MB

6 - 1 - Kruskal_'s MST Algorithm (8 min).mp4

11.6 MB

6 - 2 - Correctness of Kruskal_'s Algorithm (9 min).mp4

12.9 MB

6 - 3 - Implementing Kruskal_'s Algorithm via Union-Find I (9 min).mp4

13.5 MB

6 - 4 - Implementing Kruskal_'s Algorithm via Union-Find II (14 min).mp4

19.8 MB

6 - 5 - MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4

14.9 MB

7 - 1 - Application to Clustering (12 min).mp4

15.9 MB

7 - 2 - Correctness of Clustering Algorithm (10 min).mp4

12.5 MB

8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp4

16.0 MB

8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp4

19.1 MB

8 - 3 - Analysis of Union-by-Rank [Advanced - Optional](15).mp4

23.4 MB

8 - 4 - Path Compression [Advanced - Optional] (15).mp4

22.6 MB

8 - 5 - Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].mp4

14.3 MB

8 - 6 - Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4

18.0 MB

8 - 7 - The Ackermann Function [Advanced - Optional](17 min).mp4

23.7 MB

8 - 8 - Path Compression_ Tarjan_'s Analysis I [Advanced - Optional].mp4

21.8 MB

8 - 9 - Path Compression_ Tarjan_'s Analysis II [Advanced - Optional].mp4

20.0 MB

9 - 1 - Introduction and Motivation (9 min).mp4

12.5 MB

9 - 2 - Problem Definition (10 min).mp4

16.1 MB

9 - 3 - A Greedy Algorithm (17 min).mp4

25.9 MB

9 - 5 - Correctness Proof I (10 min).mp4

14.0 MB

9 - 6 - Correctness Proof II (13 min).mp4

17.6 MB

algo1-about.pdf

214.1 KB

algo1-asymptotic1.pdf

676.2 KB

algo1-dijkstra-basics.pdf

2.8 MB

algo1-ds-heaps-basics.pdf

2.2 MB

algo1-ds-overview.pdf

864.7 KB

algo1-graphs-search.pdf

2.4 MB

algo1-guiding.pdf

1.5 MB

algo1-intro.pdf

1.3 MB

algo1-representations.pdf

1.9 MB

algo2-dp-alignment1-annotated.pdf

2.5 MB

algo2-dp-alignment2-annotated.pdf

2.4 MB

algo2-dp-apsp1-annotated.pdf

1.1 MB

algo2-dp-apsp2-annotated.pdf

2.0 MB

algo2-dp-apsp3-annotated.pdf

2.0 MB

algo2-dp-apsp4-annotated.pdf

2.5 MB

algo2-dp-apsp56-annotated.pdf

3.2 MB

algo2-dp-bf1-annotated.pdf

1.9 MB

algo2-dp-bf2-annotated.pdf

2.0 MB

algo2-dp-bf34-annotated.pdf

2.4 MB

algo2-dp-bf5-annotated.pdf

1.3 MB

algo2-dp-bf6-annotated.pdf

2.3 MB

algo2-dp-bf78-annotated.pdf

1.8 MB

algo2-dp-bst1-annotated.pdf

2.0 MB

algo2-dp-bst23-annotated.pdf

3.4 MB

algo2-dp-bst45-annotated.pdf

3.0 MB

algo2-dp-knapsack1-annotated.pdf

1.6 MB

algo2-dp-knapsack2-annotated.pdf

1.5 MB

algo2-dp-wis1-annotated.pdf

1.2 MB

algo2-dp-wis2-annotated.pdf

1.8 MB

algo2-dp-wis3-annotated.pdf

1.7 MB

algo2-dp-wis4-annotated.pdf

1.2 MB

algo2-dp-wis5-annotated.pdf

882.8 KB

algo2-greedy-clustering1-annotated.pdf

1.9 MB

algo2-greedy-clustering2-annotated.pdf

1.7 MB

algo2-greedy-fif-annotated.pdf

1.2 MB

algo2-greedy-huffman1-annotated.pdf

1.7 MB

algo2-greedy-huffman2-annotated.pdf

2.0 MB

algo2-greedy-huffman3-annotated.pdf

2.8 MB

algo2-greedy-huffman45-annotated.pdf

3.7 MB

algo2-greedy-intro-annotated.pdf

1.8 MB

algo2-greedy-kruskal1-annotated.pdf

769.7 KB

algo2-greedy-kruskal2-annotated.pdf

1.6 MB

algo2-greedy-kruskal34-annotated.pdf

3.6 MB

algo2-greedy-kruskal5-annotated.pdf

1.3 MB

algo2-greedy-mst1-annotated.pdf

1.7 MB

algo2-greedy-mst2-annotated.pdf

1.2 MB

algo2-greedy-mst3-annotated.pdf

2.6 MB

algo2-greedy-mst4-annotated.pdf

1.1 MB

algo2-greedy-mst5-annotated.pdf

2.3 MB

algo2-greedy-mst6-annotated.pdf

3.5 MB

algo2-greedy-sched1-annotated.pdf

966.8 KB

algo2-greedy-sched2-annotated.pdf

1.7 MB

algo2-greedy-sched3-annotated.pdf

1.4 MB

algo2-greedy-sched4-annotated.pdf

973.1 KB

algo2-greedy-sched5-annotated.pdf

1.4 MB

algo2-greedy-union-find1-annotated.pdf

1.7 MB

algo2-greedy-union-find2-annotated.pdf

2.2 MB

algo2-greedy-union-find3-annotated.pdf

2.8 MB

algo2-greedy-union-find4-annotated.pdf

2.1 MB

algo2-greedy-union-find56-annotated.pdf

3.2 MB

algo2-greedy-union-find7-annotated.pdf

2.6 MB

algo2-greedy-union-find89-annotated.pdf

3.6 MB

algo2-intro-alignment-annotated.pdf

2.2 MB

algo2-intro-routing-annotated.pdf

1.5 MB

algo2-np-approx1-annotated.pdf

2.2 MB

algo2-np-approx23-annotated.pdf

2.8 MB

algo2-np-approx4-annotated.pdf

1.7 MB

algo2-np-approx5-annotated.pdf

1.5 MB

algo2-np-approx6-annotated.pdf

2.2 MB

algo2-np-exact1-annotated.pdf

1.3 MB

algo2-np-exact23-annotated.pdf

2.8 MB

algo2-np-exact4-annotated.pdf

3.1 MB

algo2-np-exact5-annotated.pdf

2.2 MB

algo2-np-local12-annotated.pdf

3.2 MB

algo2-np-local34-annotated.pdf

2.8 MB

algo2-np-local5-annotated.pdf

1.8 MB

algo2-np-local6-annotated.pdf

2.4 MB

algo2-np-local7-annotated.pdf

2.6 MB

algo2-np-npc1-annotated.pdf

1.9 MB

algo2-np-npc2-annotated.pdf

1.8 MB

algo2-np-npc34-annotated.pdf

2.3 MB

algo2-np-npc5-annotated.pdf

1.3 MB

algo2-np-npc6-annotated.pdf

1.2 MB

algo2-np-wider123-annotated.pdf

5.4 MB

imgres.html

24.5 KB

 

Total files 187


Copyright © 2025 FileMood.com