FileMood

Download Algorithms_ Design and Analysis, Part 2

Algorithms Design and Analysis Part

Name

Algorithms_ Design and Analysis, Part 2

 DOWNLOAD Copy Link

Total Size

1.9 GB

Total Files

407

Hash

C00EFBAD587F5ECB16EF2C7B4A61BBAE223AA9B6

/9 - IX. HUFFMAN CODES (Week 2)/

3 - Video (MP4) for A Greedy Algorithm (17 min).mp4

25.9 MB

5 - Video (MP4) for Correctness Proof II (13 min).mp4

17.6 MB

2 - Video (MP4) for Problem Definition (10 min).mp4

16.1 MB

4 - Video (MP4) for Correctness Proof I (10 min).mp4

14.0 MB

1 - Video (MP4) for Introduction and Motivation (9 min).mp4

12.5 MB

5 - Slides (PDF) for Correctness Proof II (13 min).pdf

3.7 MB

4 - Slides (PDF) for Correctness Proof I (10 min).pdf

3.7 MB

3 - Slides (PDF) for A Greedy Algorithm (17 min).pdf

2.8 MB

2 - Slides (PDF) for Problem Definition (10 min).pdf

2.0 MB

1 - Slides (PDF) for Introduction and Motivation (9 min).pdf

1.7 MB

3 - Subtitles (srt) for A Greedy Algorithm (17 min).srt

25.0 KB

5 - Subtitles (srt) for Correctness Proof II (13 min).srt

19.6 KB

3 - Subtitles (text) for A Greedy Algorithm (17 min).txt

17.5 KB

4 - Subtitles (srt) for Correctness Proof I (10 min).srt

14.9 KB

2 - Subtitles (srt) for Problem Definition (10 min).srt

14.8 KB

5 - Subtitles (text) for Correctness Proof II (13 min).txt

13.8 KB

1 - Subtitles (srt) for Introduction and Motivation (9 min).srt

13.5 KB

4 - Subtitles (text) for Correctness Proof I (10 min).txt

10.4 KB

2 - Subtitles (text) for Problem Definition (10 min).txt

10.4 KB

1 - Subtitles (text) for Introduction and Motivation (9 min).txt

9.5 KB

/2 - II. SELECTED REVIEW FROM PART I (Week 1)/

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

25.5 MB

7 - Video (MP4) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4

23.0 MB

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

21.2 MB

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

20.4 MB

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

19.8 MB

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

19.2 MB

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

15.2 MB

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

5.1 MB

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

4.6 MB

7 - Slides (PDF) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).pdf

2.8 MB

6 - Slides (PDF) for Graph Search - Overview [Part I Review - Optional] (23 min).pdf

2.4 MB

9 - Slides (PDF) for Heaps_ Operations and Applications [Part I Review - Optional] (18).pdf

2.2 MB

5 - Slides (PDF) for Graph Representations [Part I Review - Optional] (14 min).pdf

1.9 MB

3 - Slides (PDF) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).pdf

1.5 MB

2 - Slides (PDF) for Why Study Algorithms_ [Part I Review - Optional] (19 min).pdf

1.3 MB

8 - Slides (PDF) for Data Structures_ Overview [Part I Review - Optional] (5).pdf

864.7 KB

4 - Slides (PDF) for Big-Oh Notation [Part I Review - Optional] (4 min).pdf

676.2 KB

1 - Slides (PDF) for About the Course [Part I Review - Optional] (17 min).pdf

214.1 KB

6 - Subtitles (srt) for Graph Search - Overview [Part I Review - Optional] (23 min).srt

37.9 KB

7 - Subtitles (srt) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).srt

31.9 KB

1 - Subtitles (srt) for About the Course [Part I Review - Optional] (17 min).srt

29.8 KB

9 - Subtitles (srt) for Heaps_ Operations and Applications [Part I Review - Optional] (18).srt

28.5 KB

2 - Subtitles (srt) for Why Study Algorithms_ [Part I Review - Optional] (19 min)

27.9 KB

6 - Subtitles (text) for Graph Search - Overview [Part I Review - Optional] (23 min).txt

26.5 KB

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

24.1 KB

7 - Subtitles (text) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).txt

22.3 KB

5 - Subtitles (srt) for Graph Representations [Part I Review - Optional] (14 min).srt

22.2 KB

1 - Subtitles (text) for About the Course [Part I Review - Optional] (17 min).txt

20.7 KB

9 - Subtitles (text) for Heaps_ Operations and Applications [Part I Review - Optional] (18).txt

19.9 KB

2 - Subtitles (text) for Why Study Algorithms_ [Part I Review - Optional] (19 min)

19.4 KB

3 - Subtitles (text) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).txt

16.9 KB

5 - Subtitles (text) for Graph Representations [Part I Review - Optional] (14 min).txt

15.5 KB

8 - Subtitles (srt) for Data Structures_ Overview [Part I Review - Optional] (5).srt

7.2 KB

4 - Subtitles (srt) for Big-Oh Notation [Part I Review - Optional] (4 min).srt

6.3 KB

8 - Subtitles (text) for Data Structures_ Overview [Part I Review - Optional] (5).txt

5.1 KB

4 - Subtitles (text) for Big-Oh Notation [Part I Review - Optional] (4 min).txt

4.4 KB

/8 - VIII. ADVANCED UNION-FIND (Week 2)/

7 - Video (MP4) for The Ackermann Function [Advanced - Optional](17 min).mp4

23.7 MB

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

23.4 MB

4 - Video (MP4) for Path Compression [Advanced - Optional] (15).mp4

22.6 MB

8 - Video (MP4) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].mp4

21.8 MB

9 - Video (MP4) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].mp4

20.0 MB

2 - Video (MP4) for Union-by-Rank [Advanced - Optional] (12 min).mp4

19.1 MB

6 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4

18.0 MB

1 - Video (MP4) for Lazy Unions [Advanced - Optional] (10 min).mp4

16.0 MB

5 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].mp4

14.3 MB

8 - Slides (PDF) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].pdf

3.6 MB

9 - Slides (PDF) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].pdf

3.6 MB

6 - Slides (PDF) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].pdf

3.2 MB

5 - Slides (PDF) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].pdf

3.2 MB

3 - Slides (PDF) for Analysis of Union-by-Rank [Advanced - Optional](15).pdf

2.8 MB

7 - Slides (PDF) for The Ackermann Function [Advanced - Optional](17 min).pdf

2.6 MB

2 - Slides (PDF) for Union-by-Rank [Advanced - Optional] (12 min).pdf

2.2 MB

4 - Slides (PDF) for Path Compression [Advanced - Optional] (15).pdf

2.1 MB

1 - Slides (PDF) for Lazy Unions [Advanced - Optional] (10 min).pdf

1.7 MB

3 - Subtitles (srt) for Analysis of Union-by-Rank [Advanced - Optional](15).srt

21.6 KB

4 - Subtitles (srt) for Path Compression [Advanced - Optional] (15).srt

21.2 KB

7 - Subtitles (srt) for The Ackermann Function [Advanced - Optional](17 min).srt

21.2 KB

8 - Subtitles (srt) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].srt

20.3 KB

9 - Subtitles (srt) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].srt

18.9 KB

2 - Subtitles (srt) for Union-by-Rank [Advanced - Optional] (12 min).srt

18.5 KB

6 - Subtitles (srt) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].srt

16.6 KB

1 - Subtitles (srt) for Lazy Unions [Advanced - Optional] (10 min).srt

15.3 KB

3 - Subtitles (text) for Analysis of Union-by-Rank [Advanced - Optional](15).txt

15.0 KB

4 - Subtitles (text) for Path Compression [Advanced - Optional] (15).txt

14.7 KB

7 - Subtitles (text) for The Ackermann Function [Advanced - Optional](17 min).txt

14.6 KB

8 - Subtitles (text) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].txt

14.2 KB

5 - Subtitles (srt) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].srt

13.5 KB

9 - Subtitles (text) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].txt

13.2 KB

2 - Subtitles (text) for Union-by-Rank [Advanced - Optional] (12 min).txt

13.0 KB

6 - Subtitles (text) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].txt

11.5 KB

1 - Subtitles (text) for Lazy Unions [Advanced - Optional] (10 min).txt

10.7 KB

5 - Subtitles (text) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].txt

9.4 KB

/20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/

1 - Video (MP4) for Stable Matching [Optional] (15 min).mp4

23.6 MB

2 - Video (MP4) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).mp4

22.0 MB

3 - Video (MP4) for Linear Programming and Beyond [Optional] (11 min).mp4

17.7 MB

3 - Slides (PDF) for Linear Programming and Beyond [Optional] (11 min).pdf

5.4 MB

2 - Slides (PDF) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).pdf

5.4 MB

1 - Slides (PDF) for Stable Matching [Optional] (15 min).pdf

5.4 MB

4 - Video (MP4) for Epilogue (1 min).mp4

1.9 MB

2 - Subtitles (srt) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).srt

18.9 KB

1 - Subtitles (srt) for Stable Matching [Optional] (15 min).srt

18.8 KB

3 - Subtitles (srt) for Linear Programming and Beyond [Optional] (11 min).srt

16.3 KB

2 - Subtitles (text) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).txt

13.3 KB

1 - Subtitles (text) for Stable Matching [Optional] (15 min).txt

13.2 KB

3 - Subtitles (text) for Linear Programming and Beyond [Optional] (11 min).txt

11.4 KB

4 - Subtitles (srt) for Epilogue (1 min).srt

1.8 KB

4 - Subtitles (text) for Epilogue (1 min).txt

1.2 KB

/19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/

7 - Video (MP4) for Analysis of Papadimitriou's Algorithm (15 min).mp4

22.9 MB

6 - Video (MP4) for Random Walks on a Line (16 min).mp4

22.4 MB

5 - Video (MP4) for The 2-SAT Problem (15 min).mp4

20.6 MB

4 - Video (MP4) for Principles of Local Search II (10 min).mp4

15.2 MB

2 - Video (MP4) for The Maximum Cut Problem II (9 min).mp4

13.5 MB

1 - Video (MP4) for The Maximum Cut Problem I (9 min).mp4

13.0 MB

3 - Video (MP4) for Principles of Local Search I (9 min).mp4

12.8 MB

1 - Slides (PDF) for The Maximum Cut Problem I (9 min).pdf

3.2 MB

2 - Slides (PDF) for The Maximum Cut Problem II (9 min).pdf

3.2 MB

3 - Slides (PDF) for Principles of Local Search I (9 min).pdf

2.8 MB

4 - Slides (PDF) for Principles of Local Search II (10 min).pdf

2.8 MB

7 - Slides (PDF) for Analysis of Papadimitriou's Algorithm (15 min).pdf

2.6 MB

6 - Slides (PDF) for Random Walks on a Line (16 min).pdf

2.4 MB

5 - Slides (PDF) for The 2-SAT Problem (15 min).pdf

1.8 MB

6 - Subtitles (srt) for Random Walks on a Line (16 min).srt

23.4 KB

5 - Subtitles (srt) for The 2-SAT Problem (15 min).srt

21.4 KB

7 - Subtitles (srt) for Analysis of Papadimitriou's Algorithm (15 min).srt

20.6 KB

4 - Subtitles (srt) for Principles of Local Search II (10 min).srt

17.0 KB

6 - Subtitles (text) for Random Walks on a Line (16 min).txt

16.2 KB

5 - Subtitles (text) for The 2-SAT Problem (15 min).txt

15.0 KB

7 - Subtitles (text) for Analysis of Papadimitriou's Algorithm (15 min).txt

14.4 KB

2 - Subtitles (srt) for The Maximum Cut Problem II (9 min).srt

14.1 KB

3 - Subtitles (srt) for Principles of Local Search I (9 min).srt

13.9 KB

1 - Subtitles (srt) for The Maximum Cut Problem I (9 min).srt

12.2 KB

4 - Subtitles (text) for Principles of Local Search II (10 min).txt

11.9 KB

2 - Subtitles (text) for The Maximum Cut Problem II (9 min).txt

9.9 KB

3 - Subtitles (text) for Principles of Local Search I (9 min).txt

9.7 KB

1 - Subtitles (text) for The Maximum Cut Problem I (9 min).txt

8.6 KB

/17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/

4 - Video (MP4) for The Traveling Salesman Problem (15 min).mp4

22.0 MB

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

18.3 MB

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

14.8 MB

1 - Video (MP4) for The Vertex Cover Problem (9 min).mp4

13.4 MB

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

10.9 MB

4 - Slides (PDF) for The Traveling Salesman Problem (15 min).pdf

3.1 MB

2 - Slides (PDF) for Smarter Search for Vertex Cover I (10 min).pdf

2.8 MB

3 - Slides (PDF) for Smarter Search for Vertex Cover II (8 min).pdf

2.8 MB

5 - Slides (PDF) for A Dynamic Programming Algorithm for TSP (12 min).pdf

2.2 MB

1 - Slides (PDF) for The Vertex Cover Problem (9 min).pdf

1.3 MB

4 - Subtitles (srt) for The Traveling Salesman Problem (15 min).srt

21.9 KB

5 - Subtitles (srt) for A Dynamic Programming Algorithm for TSP (12 min).srt

17.3 KB

4 - Subtitles (text) for The Traveling Salesman Problem (15 min).txt

15.3 KB

2 - Subtitles (srt) for Smarter Search for Vertex Cover I (10 min).srt

13.4 KB

1 - Subtitles (srt) for The Vertex Cover Problem (9 min).srt

12.7 KB

5 - Subtitles (text) for A Dynamic Programming Algorithm for TSP (12 min).txt

12.0 KB

3 - Subtitles (srt) for Smarter Search for Vertex Cover II (8 min).srt

11.0 KB

2 - Subtitles (text) for Smarter Search for Vertex Cover I (10 min).txt

9.4 KB

1 - Subtitles (text) for The Vertex Cover Problem (9 min).txt

8.9 KB

3 - Subtitles (text) for Smarter Search for Vertex Cover II (8 min).txt

7.7 KB

/16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/

1 - Video (MP4) for Polynomial-Time Solvable Problems (14 min).mp4

21.5 MB

2 - Video (MP4) for Reductions and Completeness (14 min).mp4

20.8 MB

6 - Video (MP4) for Algorithmic Approaches to NP-Complete Problems (13 min).mp4

20.8 MB

3 - Video (MP4) for Definition and Interpretation of NP-Completeness I (11 min).mp4

17.1 MB

5 - Video (MP4) for The P vs. NP Question (9 min).mp4

15.0 MB

4 - Video (MP4) for Definition and Interpretation of NP-Completeness II (8 min).mp4

12.8 MB

3 - Slides (PDF) for Definition and Interpretation of NP-Completeness I (11 min).pdf

2.3 MB

4 - Slides (PDF) for Definition and Interpretation of NP-Completeness II (8 min).pdf

2.3 MB

1 - Slides (PDF) for Polynomial-Time Solvable Problems (14 min).pdf

1.9 MB

2 - Slides (PDF) for Reductions and Completeness (14 min).pdf

1.8 MB

5 - Slides (PDF) for The P vs. NP Question (9 min).pdf

1.3 MB

6 - Slides (PDF) for Algorithmic Approaches to NP-Complete Problems (13 min).pdf

1.2 MB

1 - Subtitles (srt) for Polynomial-Time Solvable Problems (14 min).srt

20.6 KB

6 - Subtitles (srt) for Algorithmic Approaches to NP-Complete Problems (13 min).srt

19.6 KB

2 - Subtitles (srt) for Reductions and Completeness (14 min).srt

19.0 KB

3 - Subtitles (srt) for Definition and Interpretation of NP-Completeness I (11 min).srt

15.1 KB

1 - Subtitles (text) for Polynomial-Time Solvable Problems (14 min).txt

14.3 KB

6 - Subtitles (text) for Algorithmic Approaches to NP-Complete Problems (13 min).txt

13.7 KB

2 - Subtitles (text) for Reductions and Completeness (14 min).txt

13.3 KB

5 - Subtitles (srt) for The P vs. NP Question (9 min).srt

12.6 KB

4 - Subtitles (srt) for Definition and Interpretation of NP-Completeness II (8 min).srt

11.1 KB

3 - Subtitles (text) for Definition and Interpretation of NP-Completeness I (11 min).txt

10.5 KB

5 - Subtitles (text) for The P vs. NP Question (9 min).txt

8.8 KB

4 - Subtitles (text) for Definition and Interpretation of NP-Completeness II (8 min).txt

7.8 KB

/5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/

6 - Video (MP4) for Fast Implementation I (15 min).mp4

20.6 MB

3 - Video (MP4) for Correctness Proof I (16 min).mp4

19.9 MB

1 - Video (MP4) for MST Problem Definition (11 min).mp4

15.7 MB

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

15.7 MB

7 - Video (MP4) for Fast Implementation II (10 min).mp4

13.8 MB

4 - Video (MP4) for Correctness Proof II (8 min).mp4

10.6 MB

2 - Video (MP4) for Prim's MST Algorithm (8 min).mp4

10.5 MB

6 - Slides (PDF) for Fast Implementation I (15 min).pdf

3.5 MB

7 - Slides (PDF) for Fast Implementation II (10 min).pdf

3.5 MB

3 - Slides (PDF) for Correctness Proof I (16 min).pdf

2.6 MB

5 - Slides (PDF) for Proof of Cut Property [Advanced - Optional] (12 min).pdf

2.3 MB

1 - Slides (PDF) for MST Problem Definition (11 min).pdf

1.7 MB

2 - Slides (PDF) for Prim's MST Algorithm (8 min).pdf

1.2 MB

4 - Slides (PDF) for Correctness Proof II (8 min).pdf

1.1 MB

6 - Subtitles (srt) for Fast Implementation I (15 min).srt

22.3 KB

3 - Subtitles (srt) for Correctness Proof I (16 min).srt

22.0 KB

5 - Subtitles (srt) for Proof of Cut Property [Advanced - Optional] (12 min).srt

18.1 KB

1 - Subtitles (srt) for MST Problem Definition (11 min).srt

17.2 KB

6 - Subtitles (text) for Fast Implementation I (15 min).txt

15.6 KB

3 - Subtitles (text) for Correctness Proof I (16 min).txt

15.4 KB

7 - Subtitles (srt) for Fast Implementation II (10 min).srt

14.4 KB

5 - Subtitles (text) for Proof of Cut Property [Advanced - Optional] (12 min).txt

12.7 KB

1 - Subtitles (text) for MST Problem Definition (11 min).txt

12.1 KB

2 - Subtitles (srt) for Prim's MST Algorithm (8 min).srt

12.0 KB

4 - Subtitles (srt) for Correctness Proof II (8 min).srt

12.0 KB

7 - Subtitles (text) for Fast Implementation II (10 min).txt

10.1 KB

2 - Subtitles (text) for Prim's MST Algorithm (8 min).txt

8.5 KB

4 - Subtitles (text) for Correctness Proof II (8 min).txt

8.4 KB

/15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/

4 - Video (MP4) for A Reweighting Technique (14 min).mp4

20.6 MB

3 - Video (MP4) for The Floyd-Warshall Algorithm (13 min).mp4

19.8 MB

6 - Video (MP4) for Johnson's Algorithm II (11 min).mp4

17.7 MB

2 - Video (MP4) for Optimal Substructure (12 min).mp4

17.3 MB

5 - Video (MP4) for Johnson's Algorithm I (11 min).mp4

16.2 MB

1 - Video (MP4) for Problem Definition (7 min).mp4

9.9 MB

6 - Slides (PDF) for Johnson's Algorithm II (11 min).pdf

3.2 MB

5 - Slides (PDF) for Johnson's Algorithm I (11 min).pdf

3.2 MB

4 - Slides (PDF) for A Reweighting Technique (14 min).pdf

2.5 MB

3 - Slides (PDF) for The Floyd-Warshall Algorithm (13 min).pdf

2.0 MB

2 - Slides (PDF) for Optimal Substructure (12 min).pdf

2.0 MB

1 - Slides (PDF) for Problem Definition (7 min).pdf

1.1 MB

3 - Subtitles (srt) for The Floyd-Warshall Algorithm (13 min).srt

20.7 KB

4 - Subtitles (srt) for A Reweighting Technique (14 min).srt

19.4 KB

2 - Subtitles (srt) for Optimal Substructure (12 min).srt

18.6 KB

6 - Subtitles (srt) for Johnson's Algorithm II (11 min).srt

15.9 KB

5 - Subtitles (srt) for Johnson's Algorithm I (11 min).srt

14.9 KB

3 - Subtitles (text) for The Floyd-Warshall Algorithm (13 min).txt

14.4 KB

4 - Subtitles (text) for A Reweighting Technique (14 min).txt

13.6 KB

2 - Subtitles (text) for Optimal Substructure (12 min).txt

13.0 KB

6 - Subtitles (text) for Johnson's Algorithm II (11 min).txt

11.1 KB

5 - Subtitles (text) for Johnson's Algorithm I (11 min).txt

10.5 KB

1 - Subtitles (srt) for Problem Definition (7 min).srt

10.4 KB

1 - Subtitles (text) for Problem Definition (7 min).txt

7.3 KB

/12 - XII. SEQUENCE ALIGNMENT (Week 3)/

1 - Video (MP4) for Optimal Substructure (14 min).mp4

20.5 MB

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

17.5 MB

1 - Slides (PDF) for Optimal Substructure (14 min).pdf

2.5 MB

2 - Slides (PDF) for A Dynamic Programming Algorithm (12 min).pdf

2.4 MB

1 - Subtitles (srt) for Optimal Substructure (14 min).srt

19.9 KB

2 - Subtitles (srt) for A Dynamic Programming Algorithm (12 min).srt

18.2 KB

1 - Subtitles (text) for Optimal Substructure (14 min).txt

14.0 KB

2 - Subtitles (text) for A Dynamic Programming Algorithm (12 min).txt

12.8 KB

/6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/

4 - Video (MP4) for Implementing Kruskal's Algorithm via Union-Find II (14 min).mp4

19.8 MB

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

14.9 MB

3 - Video (MP4) for Implementing Kruskal's Algorithm via Union-Find I (9 min).mp4

13.5 MB

2 - Video (MP4) for Correctness of Kruskal's Algorithm (9 min).mp4

12.9 MB

1 - Video (MP4) for Kruskal's MST Algorithm (8 min).mp4

11.6 MB

3 - Slides (PDF) for Implementing Kruskal's Algorithm via Union-Find I (9 min).pdf

3.6 MB

4 - Slides (PDF) for Implementing Kruskal's Algorithm via Union-Find II (14 min).pdf

3.6 MB

2 - Slides (PDF) for Correctness of Kruskal's Algorithm (9 min).pdf

1.6 MB

5 - Slides (PDF) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).pdf

1.3 MB

1 - Slides (PDF) for Kruskal's MST Algorithm (8 min).pdf

769.7 KB

4 - Subtitles (srt) for Implementing Kruskal's Algorithm via Union-Find II (14 min).srt

21.2 KB

3 - Subtitles (srt) for Implementing Kruskal's Algorithm via Union-Find I (9 min).srt

14.8 KB

4 - Subtitles (text) for Implementing Kruskal's Algorithm via Union-Find II (14 min).txt

14.8 KB

5 - Subtitles (srt) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).srt

14.1 KB

2 - Subtitles (srt) for Correctness of Kruskal's Algorithm (9 min).srt

14.1 KB

1 - Subtitles (srt) for Kruskal's MST Algorithm (8 min).srt

12.5 KB

3 - Subtitles (text) for Implementing Kruskal's Algorithm via Union-Find I (9 min).txt

10.4 KB

5 - Subtitles (text) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).txt

9.9 KB

2 - Subtitles (text) for Correctness of Kruskal's Algorithm (9 min).txt

9.8 KB

1 - Subtitles (text) for Kruskal's MST Algorithm (8 min).txt

8.8 KB

/18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/

6 - Video (MP4) for Ananysis of Dynamic Programming Heuristic (15 min).mp4

19.7 MB

1 - Video (MP4) for A Greedy Knapsack Heuristic (14 min).mp4

19.7 MB

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

16.1 MB

5 - Video (MP4) for Knapsack via Dynamic Programming, Revisited (10 min).mp4

13.9 MB

3 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic II (10 min).mp4

13.0 MB

2 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic I (7 min).mp4

9.4 MB

2 - Slides (PDF) for Analysis of a Greedy Knapsack Heuristic I (7 min).pdf

2.8 MB

3 - Slides (PDF) for Analysis of a Greedy Knapsack Heuristic II (10 min).pdf

2.8 MB

1 - Slides (PDF) for A Greedy Knapsack Heuristic (14 min).pdf

2.2 MB

6 - Slides (PDF) for Ananysis of Dynamic Programming Heuristic (15 min).pdf

2.2 MB

4 - Slides (PDF) for A Dynamic Programming Heuristic for Knapsack (12 min).pdf

1.7 MB

5 - Slides (PDF) for Knapsack via Dynamic Programming, Revisited (10 min).pdf

1.5 MB

6 - Subtitles (srt) for Ananysis of Dynamic Programming Heuristic (15 min).srt

20.4 KB

1 - Subtitles (srt) for A Greedy Knapsack Heuristic (14 min).srt

20.3 KB

4 - Subtitles (srt) for A Dynamic Programming Heuristic for Knapsack (12 min).srt

16.8 KB

5 - Subtitles (srt) for Knapsack via Dynamic Programming, Revisited (10 min).srt

14.8 KB

3 - Subtitles (srt) for Analysis of a Greedy Knapsack Heuristic II (10 min).srt

14.5 KB

6 - Subtitles (text) for Ananysis of Dynamic Programming Heuristic (15 min).txt

14.3 KB

1 - Subtitles (text) for A Greedy Knapsack Heuristic (14 min).txt

14.1 KB

4 - Subtitles (text) for A Dynamic Programming Heuristic for Knapsack (12 min).txt

11.8 KB

5 - Subtitles (text) for Knapsack via Dynamic Programming, Revisited (10 min).txt

10.3 KB

3 - Subtitles (text) for Analysis of a Greedy Knapsack Heuristic II (10 min).txt

10.2 KB

2 - Subtitles (srt) for Analysis of a Greedy Knapsack Heuristic I (7 min).srt

9.7 KB

2 - Subtitles (text) for Analysis of a Greedy Knapsack Heuristic I (7 min).txt

6.8 KB

/14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/

6 - Video (MP4) for A Space Optimization (12 min).mp4

19.2 MB

7 - Video (MP4) for Internet Routing I [Optional] (11 min).mp4

17.5 MB

2 - Video (MP4) for Optimal Substructure (11 min).mp4

16.0 MB

1 - Video (MP4) for Single-Source Shortest Paths, Revisted (11 min).mp4

15.9 MB

4 - Video (MP4) for The Basic Algorithm II (11 min).mp4

14.3 MB

5 - Video (MP4) for Detecting Negative Cycles (9 min).mp4

13.4 MB

3 - Video (MP4) for The Basic Algorithm I (9 min).mp4

12.7 MB

8 - Video (MP4) for Internet Routing II [Optional] (7 min).mp4

11.2 MB

4 - Slides (PDF) for The Basic Algorithm II (11 min).pdf

2.4 MB

3 - Slides (PDF) for The Basic Algorithm I (9 min).pdf

2.4 MB

6 - Slides (PDF) for A Space Optimization (12 min).pdf

2.3 MB

2 - Slides (PDF) for Optimal Substructure (11 min).pdf

2.0 MB

1 - Slides (PDF) for Single-Source Shortest Paths, Revisted (11 min).pdf

1.9 MB

7 - Slides (PDF) for Internet Routing I [Optional] (11 min).pdf

1.8 MB

8 - Slides (PDF) for Internet Routing II [Optional] (7 min).pdf

1.8 MB

5 - Slides (PDF) for Detecting Negative Cycles (9 min).pdf

1.3 MB

7 - Subtitles (srt) for Internet Routing I [Optional] (11 min).srt

17.9 KB

6 - Subtitles (srt) for A Space Optimization (12 min).srt

17.8 KB

1 - Subtitles (srt) for Single-Source Shortest Paths, Revisted (11 min).srt

16.7 KB

2 - Subtitles (srt) for Optimal Substructure (11 min).srt

15.7 KB

4 - Subtitles (srt) for The Basic Algorithm II (11 min).srt

15.2 KB

5 - Subtitles (srt) for Detecting Negative Cycles (9 min).srt

13.5 KB

7 - Subtitles (text) for Internet Routing I [Optional] (11 min).txt

12.6 KB

6 - Subtitles (text) for A Space Optimization (12 min).txt

12.4 KB

3 - Subtitles (srt) for The Basic Algorithm I (9 min).srt

12.1 KB

1 - Subtitles (text) for Single-Source Shortest Paths, Revisted (11 min).txt

11.7 KB

2 - Subtitles (text) for Optimal Substructure (11 min).txt

11.0 KB

4 - Subtitles (text) for The Basic Algorithm II (11 min).txt

10.6 KB

8 - Subtitles (srt) for Internet Routing II [Optional] (7 min).srt

10.6 KB

5 - Subtitles (text) for Detecting Negative Cycles (9 min).txt

9.5 KB

3 - Subtitles (text) for The Basic Algorithm I (9 min).txt

8.5 KB

8 - Subtitles (text) for Internet Routing II [Optional] (7 min).txt

7.4 KB

/3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/

1 - Video (MP4) for Introduction to Greedy Algorithms (13 min).mp4

18.9 MB

2 - Video (MP4) for Application_ Optimal Caching (11 min).mp4

15.7 MB

1 - Slides (PDF) for Introduction to Greedy Algorithms (13 min).pdf

1.8 MB

2 - Slides (PDF) for Application_ Optimal Caching (11 min).pdf

1.2 MB

1 - Subtitles (srt) for Introduction to Greedy Algorithms (13 min).srt

20.8 KB

2 - Subtitles (srt) for Application_ Optimal Caching (11 min).srt

16.0 KB

1 - Subtitles (text) for Introduction to Greedy Algorithms (13 min).txt

14.4 KB

2 - Subtitles (text) for Application_ Optimal Caching (11 min).txt

11.2 KB

/13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/

1 - Video (MP4) for Problem Definition (12 min).mp4

18.0 MB

4 - Video (MP4) for A Dynamic Programming Algorithm I (10 min).mp4

14.7 MB

2 - Video (MP4) for Optimal Substructure (9 min).mp4

14.6 MB

5 - Video (MP4) for A Dynamic Programming Algorithm II (9 min).mp4

12.5 MB

3 - Video (MP4) for Proof of Optimal Substructure (7 min).mp4

10.3 MB

3 - Slides (PDF) for Proof of Optimal Substructure (7 min).pdf

3.4 MB

2 - Slides (PDF) for Optimal Substructure (9 min).pdf

3.4 MB

5 - Slides (PDF) for A Dynamic Programming Algorithm II (9 min).pdf

3.0 MB

4 - Slides (PDF) for A Dynamic Programming Algorithm I (10 min).pdf

3.0 MB

1 - Slides (PDF) for Problem Definition (12 min).pdf

2.0 MB

1 - Subtitles (srt) for Problem Definition (12 min).srt

19.3 KB

4 - Subtitles (srt) for A Dynamic Programming Algorithm I (10 min).srt

15.4 KB

5 - Subtitles (srt) for A Dynamic Programming Algorithm II (9 min).srt

14.8 KB

2 - Subtitles (srt) for Optimal Substructure (9 min).srt

14.8 KB

1 - Subtitles (text) for Problem Definition (12 min).txt

13.5 KB

4 - Subtitles (text) for A Dynamic Programming Algorithm I (10 min).txt

10.8 KB

5 - Subtitles (text) for A Dynamic Programming Algorithm II (9 min).txt

10.4 KB

2 - Subtitles (text) for Optimal Substructure (9 min).txt

10.3 KB

3 - Subtitles (srt) for Proof of Optimal Substructure (7 min).srt

9.3 KB

3 - Subtitles (text) for Proof of Optimal Substructure (7 min).txt

6.5 KB

/4 - IV. A SCHEDULING APPLICATION (Week 1)/

2 - Video (MP4) for A Greedy Algorithm (13 min).mp4

18.0 MB

5 - Video (MP4) for Handling Ties [Advanced - Optional] (7 min).mp4

10.1 MB

3 - Video (MP4) for Correctness Proof - Part I (7 min).mp4

9.7 MB

1 - Video (MP4) for Problem Definition (6 min).mp4

8.2 MB

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

6.5 MB

2 - Slides (PDF) for A Greedy Algorithm (13 min).pdf

1.7 MB

5 - Slides (PDF) for Handling Ties [Advanced - Optional] (7 min).pdf

1.4 MB

3 - Slides (PDF) for Correctness Proof - Part I (7 min).pdf

1.4 MB

4 - Slides (PDF) for Correctness Proof - Part II (5 min).pdf

973.1 KB

1 - Slides (PDF) for Problem Definition (6 min).pdf

966.8 KB

2 - Subtitles (srt) for A Greedy Algorithm (13 min).srt

20.8 KB

2 - Subtitles (text) for A Greedy Algorithm (13 min).txt

14.5 KB

5 - Subtitles (srt) for Handling Ties [Advanced - Optional] (7 min).srt

11.3 KB

3 - Subtitles (srt) for Correctness Proof - Part I (7 min).srt

11.0 KB

1 - Subtitles (srt) for Problem Definition (6 min).srt

9.5 KB

5 - Subtitles (text) for Handling Ties [Advanced - Optional] (7 min).txt

7.9 KB

3 - Subtitles (text) for Correctness Proof - Part I (7 min).txt

7.8 KB

1 - Subtitles (text) for Problem Definition (6 min).txt

6.7 KB

4 - Subtitles (srt) for Correctness Proof - Part II (5 min).srt

6.6 KB

4 - Subtitles (text) for Correctness Proof - Part II (5 min).txt

4.6 KB

/7 - VII. CLUSTERING (Week 2)/

1 - Video (MP4) for Application to Clustering (12 min).mp4

15.9 MB

2 - Video (MP4) for Correctness of Clustering Algorithm (10 min).mp4

12.5 MB

1 - Slides (PDF) for Application to Clustering (12 min).pdf

1.9 MB

2 - Slides (PDF) for Correctness of Clustering Algorithm (10 min).pdf

1.7 MB

1 - Subtitles (srt) for Application to Clustering (12 min).srt

17.4 KB

2 - Subtitles (srt) for Correctness of Clustering Algorithm (10 min).srt

15.3 KB

1 - Subtitles (text) for Application to Clustering (12 min).txt

12.1 KB

2 - Subtitles (text) for Correctness of Clustering Algorithm (10 min).txt

10.8 KB

/10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/

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

15.2 MB

2 - Video (MP4) for WIS in Path Graphs_ Optimal Substructure (9 min).mp4

14.2 MB

5 - Video (MP4) for Principles of Dynamic Programming (8 min).mp4

12.9 MB

1 - Video (MP4) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).mp4

11.8 MB

4 - Video (MP4) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).mp4

10.1 MB

2 - Slides (PDF) for WIS in Path Graphs_ Optimal Substructure (9 min).pdf

1.8 MB

3 - Slides (PDF) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).pdf

1.7 MB

1 - Slides (PDF) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).pdf

1.2 MB

4 - Slides (PDF) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).pdf

1.2 MB

5 - Slides (PDF) for Principles of Dynamic Programming (8 min).pdf

882.8 KB

3 - Subtitles (srt) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).srt

14.7 KB

2 - Subtitles (srt) for WIS in Path Graphs_ Optimal Substructure (9 min).srt

12.9 KB

1 - Subtitles (srt) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).srt

12.3 KB

5 - Subtitles (srt) for Principles of Dynamic Programming (8 min).srt

11.7 KB

4 - Subtitles (srt) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).srt

10.5 KB

3 - Subtitles (text) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).txt

10.3 KB

2 - Subtitles (text) for WIS in Path Graphs_ Optimal Substructure (9 min).txt

9.0 KB

1 - Subtitles (text) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).txt

8.6 KB

5 - Subtitles (text) for Principles of Dynamic Programming (8 min).txt

8.2 KB

4 - Subtitles (text) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).txt

7.3 KB

/11 - XI. THE KNAPSACK PROBLEM (Week 3)/

1 - Video (MP4) for The Knapsack Problem (10 min).mp4

14.8 MB

2 - Video (MP4) for A Dynamic Programming Algorithm (10 min).mp4

14.3 MB

1 - Slides (PDF) for The Knapsack Problem (10 min).pdf

1.6 MB

2 - Slides (PDF) for A Dynamic Programming Algorithm (10 min).pdf

1.5 MB

2 - Subtitles (srt) for A Dynamic Programming Algorithm (10 min).srt

14.0 KB

1 - Subtitles (srt) for The Knapsack Problem (10 min).srt

13.6 KB

2 - Subtitles (text) for A Dynamic Programming Algorithm (10 min).txt

9.8 KB

1 - Subtitles (text) for The Knapsack Problem (10 min).txt

9.6 KB

/1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/

1 - Video (MP4) for Application_ Internet Routing (11 min).mp4

14.5 MB

2 - Video (MP4) for Application_ Sequence Alignment (9 min).mp4

11.6 MB

2 - Slides (PDF) for Application_ Sequence Alignment (9 min).pdf

2.2 MB

1 - Slides (PDF) for Application_ Internet Routing (11 min).pdf

1.5 MB

1 - Subtitles (srt) for Application_ Internet Routing (11 min).srt

17.0 KB

2 - Subtitles (srt) for Application_ Sequence Alignment (9 min).srt

12.7 KB

1 - Subtitles (text) for Application_ Internet Routing (11 min).txt

11.9 KB

2 - Subtitles (text) for Application_ Sequence Alignment (9 min).txt

8.9 KB

 

Total files 407


Copyright © 2024 FileMood.com