Algorithms_ Design and Analysis, Part 2

BT种子名称

分享给好友

BT种子基本信息

种子哈希：c00efbad587f5ecb16ef2c7b4a61bbae223aa9b6
文档大小：1.9 GB
文档个数：407个文档
下载次数：217次
下载速度：极快
收录时间：2017-02-09
最近下载：2025-04-09
DMCA/屏蔽：DMCA/屏蔽

下载磁力链接

magnet:?xt=urn:btih:C00EFBAD587F5ECB16EF2C7B4A61BBAE223AA9B6
复制磁力链接到utorrent、Bitcomet、迅雷、115、百度网盘等下载工具进行下载。

下载BT种子

磁力链接种子下载迅雷下载二维码迅雷看看
磁力链接在线播放？试试百度云网盘离线下载播放！

Algorithms_ Design and Analysis, Part 2的二维码

文档列表

9 - IX. HUFFMAN CODES (Week 2)/3 - Video (MP4) for A Greedy Algorithm (17 min).mp4 25.9 MB
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
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Video (MP4) for The Ackermann Function [Advanced - Optional](17 min).mp4 23.7 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Video (MP4) for Stable Matching [Optional] (15 min).mp4 23.6 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Video (MP4) for Analysis of Union-by-Rank [Advanced - Optional](15).mp4 23.4 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Video (MP4) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4 23.0 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Video (MP4) for Analysis of Papadimitriou's Algorithm (15 min).mp4 22.9 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Video (MP4) for Path Compression [Advanced - Optional] (15).mp4 22.6 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Video (MP4) for Random Walks on a Line (16 min).mp4 22.4 MB
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
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Video (MP4) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).mp4 22.0 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Video (MP4) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].mp4 21.8 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Video (MP4) for Polynomial-Time Solvable Problems (14 min).mp4 21.5 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Video (MP4) for Why Study Algorithms_ [Part I Review - Optional] (19 min).mp4 21.2 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Video (MP4) for Reductions and Completeness (14 min).mp4 20.8 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Video (MP4) for Algorithmic Approaches to NP-Complete Problems (13 min).mp4 20.8 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Video (MP4) for Fast Implementation I (15 min).mp4 20.6 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Video (MP4) for The 2-SAT Problem (15 min).mp4 20.6 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Video (MP4) for A Reweighting Technique (14 min).mp4 20.6 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Video (MP4) for Optimal Substructure (14 min).mp4 20.5 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Video (MP4) for Heaps_ Operations and Applications [Part I Review - Optional] (18).mp4 20.4 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Video (MP4) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].mp4 20.0 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Video (MP4) for Correctness Proof I (16 min).mp4 19.9 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Video (MP4) for The Floyd-Warshall Algorithm (13 min).mp4 19.8 MB
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
2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Video (MP4) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4 19.8 MB
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
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Video (MP4) for A Greedy Knapsack Heuristic (14 min).mp4 19.7 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Video (MP4) for A Space Optimization (12 min).mp4 19.2 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Video (MP4) for About the Course [Part I Review - Optional] (17 min).mp4 19.2 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Video (MP4) for Union-by-Rank [Advanced - Optional] (12 min).mp4 19.1 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Video (MP4) for Introduction to Greedy Algorithms (13 min).mp4 18.9 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Video (MP4) for A Dynamic Programming Algorithm for TSP (12 min).mp4 18.3 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Video (MP4) for Problem Definition (12 min).mp4 18.0 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].mp4 18.0 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Video (MP4) for A Greedy Algorithm (13 min).mp4 18.0 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Video (MP4) for Johnson's Algorithm II (11 min).mp4 17.7 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Video (MP4) for Linear Programming and Beyond [Optional] (11 min).mp4 17.7 MB
9 - IX. HUFFMAN CODES (Week 2)/5 - Video (MP4) for Correctness Proof II (13 min).mp4 17.6 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Video (MP4) for Internet Routing I [Optional] (11 min).mp4 17.5 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Video (MP4) for A Dynamic Programming Algorithm (12 min).mp4 17.5 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Video (MP4) for Optimal Substructure (12 min).mp4 17.3 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Video (MP4) for Definition and Interpretation of NP-Completeness I (11 min).mp4 17.1 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Video (MP4) for Johnson's Algorithm I (11 min).mp4 16.2 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Video (MP4) for A Dynamic Programming Heuristic for Knapsack (12 min).mp4 16.1 MB
9 - IX. HUFFMAN CODES (Week 2)/2 - Video (MP4) for Problem Definition (10 min).mp4 16.1 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Video (MP4) for Optimal Substructure (11 min).mp4 16.0 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Video (MP4) for Lazy Unions [Advanced - Optional] (10 min).mp4 16.0 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Video (MP4) for Single-Source Shortest Paths, Revisted (11 min).mp4 15.9 MB
7 - VII. CLUSTERING (Week 2)/1 - Video (MP4) for Application to Clustering (12 min).mp4 15.9 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Video (MP4) for MST Problem Definition (11 min).mp4 15.7 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Video (MP4) for Proof of Cut Property [Advanced - Optional] (12 min).mp4 15.7 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Video (MP4) for Application_ Optimal Caching (11 min).mp4 15.7 MB
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
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Video (MP4) for Principles of Local Search II (10 min).mp4 15.2 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Video (MP4) for Graph Representations [Part I Review - Optional] (14 min).mp4 15.2 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Video (MP4) for The P vs. NP Question (9 min).mp4 15.0 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Video (MP4) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4 14.9 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Video (MP4) for Smarter Search for Vertex Cover I (10 min).mp4 14.8 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Video (MP4) for The Knapsack Problem (10 min).mp4 14.8 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Video (MP4) for A Dynamic Programming Algorithm I (10 min).mp4 14.7 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Video (MP4) for Optimal Substructure (9 min).mp4 14.6 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Video (MP4) for Application_ Internet Routing (11 min).mp4 14.5 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Video (MP4) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].mp4 14.3 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Video (MP4) for A Dynamic Programming Algorithm (10 min).mp4 14.3 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Video (MP4) for The Basic Algorithm II (11 min).mp4 14.3 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Video (MP4) for WIS in Path Graphs_ Optimal Substructure (9 min).mp4 14.2 MB
9 - IX. HUFFMAN CODES (Week 2)/4 - Video (MP4) for Correctness Proof I (10 min).mp4 14.0 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Video (MP4) for Knapsack via Dynamic Programming, Revisited (10 min).mp4 13.9 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Video (MP4) for Fast Implementation II (10 min).mp4 13.8 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Video (MP4) for Implementing Kruskal's Algorithm via Union-Find I (9 min).mp4 13.5 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Video (MP4) for The Maximum Cut Problem II (9 min).mp4 13.5 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Video (MP4) for Detecting Negative Cycles (9 min).mp4 13.4 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Video (MP4) for The Vertex Cover Problem (9 min).mp4 13.4 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Video (MP4) for The Maximum Cut Problem I (9 min).mp4 13.0 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic II (10 min).mp4 13.0 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Video (MP4) for Correctness of Kruskal's Algorithm (9 min).mp4 12.9 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Video (MP4) for Principles of Dynamic Programming (8 min).mp4 12.9 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Video (MP4) for Principles of Local Search I (9 min).mp4 12.8 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Video (MP4) for Definition and Interpretation of NP-Completeness II (8 min).mp4 12.8 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Video (MP4) for The Basic Algorithm I (9 min).mp4 12.7 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Video (MP4) for A Dynamic Programming Algorithm II (9 min).mp4 12.5 MB
7 - VII. CLUSTERING (Week 2)/2 - Video (MP4) for Correctness of Clustering Algorithm (10 min).mp4 12.5 MB
9 - IX. HUFFMAN CODES (Week 2)/1 - Video (MP4) for Introduction and Motivation (9 min).mp4 12.5 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Video (MP4) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).mp4 11.8 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Video (MP4) for Application_ Sequence Alignment (9 min).mp4 11.6 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Video (MP4) for Kruskal's MST Algorithm (8 min).mp4 11.6 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Video (MP4) for Internet Routing II [Optional] (7 min).mp4 11.2 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Video (MP4) for Smarter Search for Vertex Cover II (8 min).mp4 10.9 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Video (MP4) for Correctness Proof II (8 min).mp4 10.6 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Video (MP4) for Prim's MST Algorithm (8 min).mp4 10.5 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Video (MP4) for Proof of Optimal Substructure (7 min).mp4 10.3 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Video (MP4) for Handling Ties [Advanced - Optional] (7 min).mp4 10.1 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Video (MP4) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).mp4 10.1 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Video (MP4) for Problem Definition (7 min).mp4 9.9 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Video (MP4) for Correctness Proof - Part I (7 min).mp4 9.7 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Video (MP4) for Analysis of a Greedy Knapsack Heuristic I (7 min).mp4 9.4 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Video (MP4) for Problem Definition (6 min).mp4 8.2 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Video (MP4) for Correctness Proof - Part II (5 min).mp4 6.5 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Slides (PDF) for Linear Programming and Beyond [Optional] (11 min).pdf 5.4 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Slides (PDF) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).pdf 5.4 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Slides (PDF) for Stable Matching [Optional] (15 min).pdf 5.4 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Video (MP4) for Data Structures_ Overview [Part I Review - Optional] (5).mp4 5.1 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Video (MP4) for Big-Oh Notation [Part I Review - Optional] (4 min).mp4 4.6 MB
9 - IX. HUFFMAN CODES (Week 2)/5 - Slides (PDF) for Correctness Proof II (13 min).pdf 3.7 MB
9 - IX. HUFFMAN CODES (Week 2)/4 - Slides (PDF) for Correctness Proof I (10 min).pdf 3.7 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Slides (PDF) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].pdf 3.6 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Slides (PDF) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].pdf 3.6 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Slides (PDF) for Implementing Kruskal's Algorithm via Union-Find I (9 min).pdf 3.6 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/4 - Slides (PDF) for Implementing Kruskal's Algorithm via Union-Find II (14 min).pdf 3.6 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Slides (PDF) for Fast Implementation I (15 min).pdf 3.5 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Slides (PDF) for Fast Implementation II (10 min).pdf 3.5 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Slides (PDF) for Proof of Optimal Substructure (7 min).pdf 3.4 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Slides (PDF) for Optimal Substructure (9 min).pdf 3.4 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Slides (PDF) for The Maximum Cut Problem I (9 min).pdf 3.2 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Slides (PDF) for The Maximum Cut Problem II (9 min).pdf 3.2 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Slides (PDF) for Johnson's Algorithm II (11 min).pdf 3.2 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Slides (PDF) for Johnson's Algorithm I (11 min).pdf 3.2 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Slides (PDF) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].pdf 3.2 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Slides (PDF) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].pdf 3.2 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Slides (PDF) for The Traveling Salesman Problem (15 min).pdf 3.1 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Slides (PDF) for A Dynamic Programming Algorithm II (9 min).pdf 3.0 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Slides (PDF) for A Dynamic Programming Algorithm I (10 min).pdf 3.0 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Slides (PDF) for Analysis of a Greedy Knapsack Heuristic I (7 min).pdf 2.8 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Slides (PDF) for Analysis of a Greedy Knapsack Heuristic II (10 min).pdf 2.8 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Slides (PDF) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).pdf 2.8 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Slides (PDF) for Smarter Search for Vertex Cover I (10 min).pdf 2.8 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Slides (PDF) for Smarter Search for Vertex Cover II (8 min).pdf 2.8 MB
9 - IX. HUFFMAN CODES (Week 2)/3 - Slides (PDF) for A Greedy Algorithm (17 min).pdf 2.8 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Slides (PDF) for Principles of Local Search I (9 min).pdf 2.8 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Slides (PDF) for Principles of Local Search II (10 min).pdf 2.8 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Slides (PDF) for Analysis of Union-by-Rank [Advanced - Optional](15).pdf 2.8 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Slides (PDF) for Analysis of Papadimitriou's Algorithm (15 min).pdf 2.6 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Slides (PDF) for The Ackermann Function [Advanced - Optional](17 min).pdf 2.6 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Slides (PDF) for Correctness Proof I (16 min).pdf 2.6 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Slides (PDF) for A Reweighting Technique (14 min).pdf 2.5 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Slides (PDF) for Optimal Substructure (14 min).pdf 2.5 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Slides (PDF) for The Basic Algorithm II (11 min).pdf 2.4 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Slides (PDF) for The Basic Algorithm I (9 min).pdf 2.4 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Slides (PDF) for Graph Search - Overview [Part I Review - Optional] (23 min).pdf 2.4 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Slides (PDF) for Random Walks on a Line (16 min).pdf 2.4 MB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Slides (PDF) for A Dynamic Programming Algorithm (12 min).pdf 2.4 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Slides (PDF) for Definition and Interpretation of NP-Completeness I (11 min).pdf 2.3 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Slides (PDF) for Definition and Interpretation of NP-Completeness II (8 min).pdf 2.3 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Slides (PDF) for A Space Optimization (12 min).pdf 2.3 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Slides (PDF) for Proof of Cut Property [Advanced - Optional] (12 min).pdf 2.3 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Slides (PDF) for Union-by-Rank [Advanced - Optional] (12 min).pdf 2.2 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Slides (PDF) for Heaps_ Operations and Applications [Part I Review - Optional] (18).pdf 2.2 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Slides (PDF) for Application_ Sequence Alignment (9 min).pdf 2.2 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Slides (PDF) for A Dynamic Programming Algorithm for TSP (12 min).pdf 2.2 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Slides (PDF) for A Greedy Knapsack Heuristic (14 min).pdf 2.2 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Slides (PDF) for Ananysis of Dynamic Programming Heuristic (15 min).pdf 2.2 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Slides (PDF) for Path Compression [Advanced - Optional] (15).pdf 2.1 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Slides (PDF) for Optimal Substructure (11 min).pdf 2.0 MB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Slides (PDF) for Problem Definition (12 min).pdf 2.0 MB
9 - IX. HUFFMAN CODES (Week 2)/2 - Slides (PDF) for Problem Definition (10 min).pdf 2.0 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Slides (PDF) for The Floyd-Warshall Algorithm (13 min).pdf 2.0 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Slides (PDF) for Optimal Substructure (12 min).pdf 2.0 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Slides (PDF) for Polynomial-Time Solvable Problems (14 min).pdf 1.9 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Slides (PDF) for Single-Source Shortest Paths, Revisted (11 min).pdf 1.9 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Slides (PDF) for Graph Representations [Part I Review - Optional] (14 min).pdf 1.9 MB
7 - VII. CLUSTERING (Week 2)/1 - Slides (PDF) for Application to Clustering (12 min).pdf 1.9 MB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Video (MP4) for Epilogue (1 min).mp4 1.9 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Slides (PDF) for Reductions and Completeness (14 min).pdf 1.8 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Slides (PDF) for Introduction to Greedy Algorithms (13 min).pdf 1.8 MB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Slides (PDF) for The 2-SAT Problem (15 min).pdf 1.8 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Slides (PDF) for Internet Routing I [Optional] (11 min).pdf 1.8 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Slides (PDF) for Internet Routing II [Optional] (7 min).pdf 1.8 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Slides (PDF) for WIS in Path Graphs_ Optimal Substructure (9 min).pdf 1.8 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Slides (PDF) for A Dynamic Programming Heuristic for Knapsack (12 min).pdf 1.7 MB
9 - IX. HUFFMAN CODES (Week 2)/1 - Slides (PDF) for Introduction and Motivation (9 min).pdf 1.7 MB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Slides (PDF) for Lazy Unions [Advanced - Optional] (10 min).pdf 1.7 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Slides (PDF) for A Greedy Algorithm (13 min).pdf 1.7 MB
7 - VII. CLUSTERING (Week 2)/2 - Slides (PDF) for Correctness of Clustering Algorithm (10 min).pdf 1.7 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Slides (PDF) for MST Problem Definition (11 min).pdf 1.7 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Slides (PDF) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).pdf 1.7 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Slides (PDF) for Correctness of Kruskal's Algorithm (9 min).pdf 1.6 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Slides (PDF) for The Knapsack Problem (10 min).pdf 1.6 MB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Slides (PDF) for Knapsack via Dynamic Programming, Revisited (10 min).pdf 1.5 MB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Slides (PDF) for A Dynamic Programming Algorithm (10 min).pdf 1.5 MB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Slides (PDF) for Application_ Internet Routing (11 min).pdf 1.5 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Slides (PDF) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).pdf 1.5 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Slides (PDF) for Handling Ties [Advanced - Optional] (7 min).pdf 1.4 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Slides (PDF) for Correctness Proof - Part I (7 min).pdf 1.4 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Slides (PDF) for The P vs. NP Question (9 min).pdf 1.3 MB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Slides (PDF) for Why Study Algorithms_ [Part I Review - Optional] (19 min).pdf 1.3 MB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Slides (PDF) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).pdf 1.3 MB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Slides (PDF) for Detecting Negative Cycles (9 min).pdf 1.3 MB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Slides (PDF) for The Vertex Cover Problem (9 min).pdf 1.3 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Slides (PDF) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).pdf 1.2 MB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Slides (PDF) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).pdf 1.2 MB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Slides (PDF) for Application_ Optimal Caching (11 min).pdf 1.2 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Slides (PDF) for Prim's MST Algorithm (8 min).pdf 1.2 MB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Slides (PDF) for Algorithmic Approaches to NP-Complete Problems (13 min).pdf 1.2 MB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Slides (PDF) for Correctness Proof II (8 min).pdf 1.1 MB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Slides (PDF) for Problem Definition (7 min).pdf 1.1 MB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Slides (PDF) for Correctness Proof - Part II (5 min).pdf 973.1 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Slides (PDF) for Problem Definition (6 min).pdf 966.8 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Slides (PDF) for Principles of Dynamic Programming (8 min).pdf 882.8 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Slides (PDF) for Data Structures_ Overview [Part I Review - Optional] (5).pdf 864.7 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Slides (PDF) for Kruskal's MST Algorithm (8 min).pdf 769.7 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Slides (PDF) for Big-Oh Notation [Part I Review - Optional] (4 min).pdf 676.2 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Slides (PDF) for About the Course [Part I Review - Optional] (17 min).pdf 214.1 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Subtitles (srt) for Graph Search - Overview [Part I Review - Optional] (23 min).srt 37.9 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Subtitles (srt) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).srt 31.9 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Subtitles (srt) for About the Course [Part I Review - Optional] (17 min).srt 29.8 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Subtitles (srt) for Heaps_ Operations and Applications [Part I Review - Optional] (18).srt 28.5 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Subtitles (srt) for Why Study Algorithms_ [Part I Review - Optional] (19 min) 27.9 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/6 - Subtitles (text) for Graph Search - Overview [Part I Review - Optional] (23 min).txt 26.5 kB
9 - IX. HUFFMAN CODES (Week 2)/3 - Subtitles (srt) for A Greedy Algorithm (17 min).srt 25.0 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Subtitles (srt) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).srt 24.1 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Subtitles (srt) for Random Walks on a Line (16 min).srt 23.4 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Subtitles (srt) for Fast Implementation I (15 min).srt 22.3 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/7 - Subtitles (text) for Dijkstra's Shortest-Path Algorithm [Part I Review - Optional] (21 min).txt 22.3 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Subtitles (srt) for Graph Representations [Part I Review - Optional] (14 min).srt 22.2 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Subtitles (srt) for Correctness Proof I (16 min).srt 22.0 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (srt) for The Traveling Salesman Problem (15 min).srt 21.9 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Subtitles (srt) for Analysis of Union-by-Rank [Advanced - Optional](15).srt 21.6 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Subtitles (srt) for The 2-SAT Problem (15 min).srt 21.4 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Subtitles (srt) for Path Compression [Advanced - Optional] (15).srt 21.2 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Subtitles (srt) for The Ackermann Function [Advanced - Optional](17 min).srt 21.2 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/4 - Subtitles (srt) for Implementing Kruskal's Algorithm via Union-Find II (14 min).srt 21.2 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Subtitles (srt) for A Greedy Algorithm (13 min).srt 20.8 kB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Subtitles (srt) for Introduction to Greedy Algorithms (13 min).srt 20.8 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/1 - Subtitles (text) for About the Course [Part I Review - Optional] (17 min).txt 20.7 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Subtitles (srt) for The Floyd-Warshall Algorithm (13 min).srt 20.7 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Subtitles (srt) for Analysis of Papadimitriou's Algorithm (15 min).srt 20.6 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (srt) for Polynomial-Time Solvable Problems (14 min).srt 20.6 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Subtitles (srt) for Ananysis of Dynamic Programming Heuristic (15 min).srt 20.4 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Subtitles (srt) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].srt 20.3 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Subtitles (srt) for A Greedy Knapsack Heuristic (14 min).srt 20.3 kB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Subtitles (srt) for Optimal Substructure (14 min).srt 19.9 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/9 - Subtitles (text) for Heaps_ Operations and Applications [Part I Review - Optional] (18).txt 19.9 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Subtitles (srt) for Algorithmic Approaches to NP-Complete Problems (13 min).srt 19.6 kB
9 - IX. HUFFMAN CODES (Week 2)/5 - Subtitles (srt) for Correctness Proof II (13 min).srt 19.6 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Subtitles (srt) for A Reweighting Technique (14 min).srt 19.4 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/2 - Subtitles (text) for Why Study Algorithms_ [Part I Review - Optional] (19 min) 19.4 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Subtitles (srt) for Problem Definition (12 min).srt 19.3 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (srt) for Reductions and Completeness (14 min).srt 19.0 kB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Subtitles (srt) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).srt 18.9 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Subtitles (srt) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].srt 18.9 kB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Subtitles (srt) for Stable Matching [Optional] (15 min).srt 18.8 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Subtitles (srt) for Optimal Substructure (12 min).srt 18.6 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Subtitles (srt) for Union-by-Rank [Advanced - Optional] (12 min).srt 18.5 kB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Subtitles (srt) for A Dynamic Programming Algorithm (12 min).srt 18.2 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Subtitles (srt) for Proof of Cut Property [Advanced - Optional] (12 min).srt 18.1 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Subtitles (srt) for Internet Routing I [Optional] (11 min).srt 17.9 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Subtitles (srt) for A Space Optimization (12 min).srt 17.8 kB
9 - IX. HUFFMAN CODES (Week 2)/3 - Subtitles (text) for A Greedy Algorithm (17 min).txt 17.5 kB
7 - VII. CLUSTERING (Week 2)/1 - Subtitles (srt) for Application to Clustering (12 min).srt 17.4 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (srt) for A Dynamic Programming Algorithm for TSP (12 min).srt 17.3 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Subtitles (srt) for MST Problem Definition (11 min).srt 17.2 kB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Subtitles (srt) for Application_ Internet Routing (11 min).srt 17.0 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Subtitles (srt) for Principles of Local Search II (10 min).srt 17.0 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/3 - Subtitles (text) for Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).txt 16.9 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Subtitles (srt) for A Dynamic Programming Heuristic for Knapsack (12 min).srt 16.8 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Subtitles (srt) for Single-Source Shortest Paths, Revisted (11 min).srt 16.7 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Subtitles (srt) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].srt 16.6 kB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Subtitles (srt) for Linear Programming and Beyond [Optional] (11 min).srt 16.3 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/6 - Subtitles (text) for Random Walks on a Line (16 min).txt 16.2 kB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Subtitles (srt) for Application_ Optimal Caching (11 min).srt 16.0 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Subtitles (srt) for Johnson's Algorithm II (11 min).srt 15.9 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Subtitles (srt) for Optimal Substructure (11 min).srt 15.7 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/6 - Subtitles (text) for Fast Implementation I (15 min).txt 15.6 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/5 - Subtitles (text) for Graph Representations [Part I Review - Optional] (14 min).txt 15.5 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/3 - Subtitles (text) for Correctness Proof I (16 min).txt 15.4 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Subtitles (srt) for A Dynamic Programming Algorithm I (10 min).srt 15.4 kB
7 - VII. CLUSTERING (Week 2)/2 - Subtitles (srt) for Correctness of Clustering Algorithm (10 min).srt 15.3 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (text) for The Traveling Salesman Problem (15 min).txt 15.3 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Subtitles (srt) for Lazy Unions [Advanced - Optional] (10 min).srt 15.3 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Subtitles (srt) for The Basic Algorithm II (11 min).srt 15.2 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (srt) for Definition and Interpretation of NP-Completeness I (11 min).srt 15.1 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/3 - Subtitles (text) for Analysis of Union-by-Rank [Advanced - Optional](15).txt 15.0 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/5 - Subtitles (text) for The 2-SAT Problem (15 min).txt 15.0 kB
9 - IX. HUFFMAN CODES (Week 2)/4 - Subtitles (srt) for Correctness Proof I (10 min).srt 14.9 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Subtitles (srt) for Johnson's Algorithm I (11 min).srt 14.9 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Subtitles (srt) for Implementing Kruskal's Algorithm via Union-Find I (9 min).srt 14.8 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/4 - Subtitles (text) for Implementing Kruskal's Algorithm via Union-Find II (14 min).txt 14.8 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Subtitles (srt) for A Dynamic Programming Algorithm II (9 min).srt 14.8 kB
9 - IX. HUFFMAN CODES (Week 2)/2 - Subtitles (srt) for Problem Definition (10 min).srt 14.8 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Subtitles (srt) for Knapsack via Dynamic Programming, Revisited (10 min).srt 14.8 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Subtitles (srt) for Optimal Substructure (9 min).srt 14.8 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/4 - Subtitles (text) for Path Compression [Advanced - Optional] (15).txt 14.7 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Subtitles (srt) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).srt 14.7 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/7 - Subtitles (text) for The Ackermann Function [Advanced - Optional](17 min).txt 14.6 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/2 - Subtitles (text) for A Greedy Algorithm (13 min).txt 14.5 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Subtitles (srt) for Analysis of a Greedy Knapsack Heuristic II (10 min).srt 14.5 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Subtitles (srt) for Fast Implementation II (10 min).srt 14.4 kB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/1 - Subtitles (text) for Introduction to Greedy Algorithms (13 min).txt 14.4 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/3 - Subtitles (text) for The Floyd-Warshall Algorithm (13 min).txt 14.4 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/7 - Subtitles (text) for Analysis of Papadimitriou's Algorithm (15 min).txt 14.4 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (text) for Polynomial-Time Solvable Problems (14 min).txt 14.3 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/6 - Subtitles (text) for Ananysis of Dynamic Programming Heuristic (15 min).txt 14.3 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/8 - Subtitles (text) for Path Compression_ Tarjan's Analysis I [Advanced - Optional].txt 14.2 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/1 - Subtitles (text) for A Greedy Knapsack Heuristic (14 min).txt 14.1 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Subtitles (srt) for The Maximum Cut Problem II (9 min).srt 14.1 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Subtitles (srt) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).srt 14.1 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Subtitles (srt) for Correctness of Kruskal's Algorithm (9 min).srt 14.1 kB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Subtitles (srt) for A Dynamic Programming Algorithm (10 min).srt 14.0 kB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/1 - Subtitles (text) for Optimal Substructure (14 min).txt 14.0 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Subtitles (srt) for Principles of Local Search I (9 min).srt 13.9 kB
9 - IX. HUFFMAN CODES (Week 2)/5 - Subtitles (text) for Correctness Proof II (13 min).txt 13.8 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/6 - Subtitles (text) for Algorithmic Approaches to NP-Complete Problems (13 min).txt 13.7 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/4 - Subtitles (text) for A Reweighting Technique (14 min).txt 13.6 kB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Subtitles (srt) for The Knapsack Problem (10 min).srt 13.6 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Subtitles (srt) for Detecting Negative Cycles (9 min).srt 13.5 kB
9 - IX. HUFFMAN CODES (Week 2)/1 - Subtitles (srt) for Introduction and Motivation (9 min).srt 13.5 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/1 - Subtitles (text) for Problem Definition (12 min).txt 13.5 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Subtitles (srt) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].srt 13.5 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (srt) for Smarter Search for Vertex Cover I (10 min).srt 13.4 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (text) for Reductions and Completeness (14 min).txt 13.3 kB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/2 - Subtitles (text) for Matchings, Flows, and Braess's Paradox [Optional] (14 min).txt 13.3 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/9 - Subtitles (text) for Path Compression_ Tarjan's Analysis II [Advanced - Optional].txt 13.2 kB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/1 - Subtitles (text) for Stable Matching [Optional] (15 min).txt 13.2 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/2 - Subtitles (text) for Optimal Substructure (12 min).txt 13.0 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/2 - Subtitles (text) for Union-by-Rank [Advanced - Optional] (12 min).txt 13.0 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Subtitles (srt) for WIS in Path Graphs_ Optimal Substructure (9 min).srt 12.9 kB
12 - XII. SEQUENCE ALIGNMENT (Week 3)/2 - Subtitles (text) for A Dynamic Programming Algorithm (12 min).txt 12.8 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/5 - Subtitles (text) for Proof of Cut Property [Advanced - Optional] (12 min).txt 12.7 kB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Subtitles (srt) for Application_ Sequence Alignment (9 min).srt 12.7 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (srt) for The Vertex Cover Problem (9 min).srt 12.7 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (srt) for The P vs. NP Question (9 min).srt 12.6 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/7 - Subtitles (text) for Internet Routing I [Optional] (11 min).txt 12.6 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Subtitles (srt) for Kruskal's MST Algorithm (8 min).srt 12.5 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/6 - Subtitles (text) for A Space Optimization (12 min).txt 12.4 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Subtitles (srt) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).srt 12.3 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Subtitles (srt) for The Maximum Cut Problem I (9 min).srt 12.2 kB
7 - VII. CLUSTERING (Week 2)/1 - Subtitles (text) for Application to Clustering (12 min).txt 12.1 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/1 - Subtitles (text) for MST Problem Definition (11 min).txt 12.1 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Subtitles (srt) for The Basic Algorithm I (9 min).srt 12.1 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (text) for A Dynamic Programming Algorithm for TSP (12 min).txt 12.0 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Subtitles (srt) for Prim's MST Algorithm (8 min).srt 12.0 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Subtitles (srt) for Correctness Proof II (8 min).srt 12.0 kB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/1 - Subtitles (text) for Application_ Internet Routing (11 min).txt 11.9 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/4 - Subtitles (text) for Principles of Local Search II (10 min).txt 11.9 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/4 - Subtitles (text) for A Dynamic Programming Heuristic for Knapsack (12 min).txt 11.8 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/1 - Subtitles (text) for Single-Source Shortest Paths, Revisted (11 min).txt 11.7 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Subtitles (srt) for Principles of Dynamic Programming (8 min).srt 11.7 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/6 - Subtitles (text) for Path Compression_ The Hopcroft-Ullman Analysis II [Advanced - Optional].txt 11.5 kB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/3 - Subtitles (text) for Linear Programming and Beyond [Optional] (11 min).txt 11.4 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Subtitles (srt) for Handling Ties [Advanced - Optional] (7 min).srt 11.3 kB
3 - III. INTRODUCTION TO GREEDY ALGORITHMS (Week 1)/2 - Subtitles (text) for Application_ Optimal Caching (11 min).txt 11.2 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (srt) for Definition and Interpretation of NP-Completeness II (8 min).srt 11.1 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/6 - Subtitles (text) for Johnson's Algorithm II (11 min).txt 11.1 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (srt) for Smarter Search for Vertex Cover II (8 min).srt 11.0 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Subtitles (srt) for Correctness Proof - Part I (7 min).srt 11.0 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/2 - Subtitles (text) for Optimal Substructure (11 min).txt 11.0 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/4 - Subtitles (text) for A Dynamic Programming Algorithm I (10 min).txt 10.8 kB
7 - VII. CLUSTERING (Week 2)/2 - Subtitles (text) for Correctness of Clustering Algorithm (10 min).txt 10.8 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/1 - Subtitles (text) for Lazy Unions [Advanced - Optional] (10 min).txt 10.7 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/4 - Subtitles (text) for The Basic Algorithm II (11 min).txt 10.6 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Subtitles (srt) for Internet Routing II [Optional] (7 min).srt 10.6 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (text) for Definition and Interpretation of NP-Completeness I (11 min).txt 10.5 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/5 - Subtitles (text) for Johnson's Algorithm I (11 min).txt 10.5 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Subtitles (srt) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).srt 10.5 kB
9 - IX. HUFFMAN CODES (Week 2)/4 - Subtitles (text) for Correctness Proof I (10 min).txt 10.4 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/3 - Subtitles (text) for Implementing Kruskal's Algorithm via Union-Find I (9 min).txt 10.4 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Subtitles (srt) for Problem Definition (7 min).srt 10.4 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/5 - Subtitles (text) for A Dynamic Programming Algorithm II (9 min).txt 10.4 kB
9 - IX. HUFFMAN CODES (Week 2)/2 - Subtitles (text) for Problem Definition (10 min).txt 10.4 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/2 - Subtitles (text) for Optimal Substructure (9 min).txt 10.3 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/5 - Subtitles (text) for Knapsack via Dynamic Programming, Revisited (10 min).txt 10.3 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/3 - Subtitles (text) for WIS in Path Graphs_ A Linear-Time Algorithm (10 min).txt 10.3 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/3 - Subtitles (text) for Analysis of a Greedy Knapsack Heuristic II (10 min).txt 10.2 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/7 - Subtitles (text) for Fast Implementation II (10 min).txt 10.1 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/2 - Subtitles (text) for The Maximum Cut Problem II (9 min).txt 9.9 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/5 - Subtitles (text) for MSTs_ State-of-the-Art and Open Questions [Advanced - Optional] (9 min).txt 9.9 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/2 - Subtitles (text) for Correctness of Kruskal's Algorithm (9 min).txt 9.8 kB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/2 - Subtitles (text) for A Dynamic Programming Algorithm (10 min).txt 9.8 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Subtitles (srt) for Analysis of a Greedy Knapsack Heuristic I (7 min).srt 9.7 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/3 - Subtitles (text) for Principles of Local Search I (9 min).txt 9.7 kB
11 - XI. THE KNAPSACK PROBLEM (Week 3)/1 - Subtitles (text) for The Knapsack Problem (10 min).txt 9.6 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/5 - Subtitles (text) for Detecting Negative Cycles (9 min).txt 9.5 kB
9 - IX. HUFFMAN CODES (Week 2)/1 - Subtitles (text) for Introduction and Motivation (9 min).txt 9.5 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Subtitles (srt) for Problem Definition (6 min).srt 9.5 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/2 - Subtitles (text) for Smarter Search for Vertex Cover I (10 min).txt 9.4 kB
8 - VIII. ADVANCED UNION-FIND (Week 2)/5 - Subtitles (text) for Path Compression_ The Hopcroft-Ullman Analysis I [Advanced - Optional].txt 9.4 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Subtitles (srt) for Proof of Optimal Substructure (7 min).srt 9.3 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/2 - Subtitles (text) for WIS in Path Graphs_ Optimal Substructure (9 min).txt 9.0 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/1 - Subtitles (text) for The Vertex Cover Problem (9 min).txt 8.9 kB
1 - I. TWO MOTIVATING APPLICATIONS (Week 1)/2 - Subtitles (text) for Application_ Sequence Alignment (9 min).txt 8.9 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/5 - Subtitles (text) for The P vs. NP Question (9 min).txt 8.8 kB
6 - VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM (Week 2)/1 - Subtitles (text) for Kruskal's MST Algorithm (8 min).txt 8.8 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/1 - Subtitles (text) for Introduction_ Weighted Independent Sets in Path Graphs (8 min).txt 8.6 kB
19 - XIX. LOCAL SEARCH ALGORITHMS (Week 6)/1 - Subtitles (text) for The Maximum Cut Problem I (9 min).txt 8.6 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/3 - Subtitles (text) for The Basic Algorithm I (9 min).txt 8.5 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/2 - Subtitles (text) for Prim's MST Algorithm (8 min).txt 8.5 kB
5 - V. PRIM'S MINIMUM SPANNING TREE ALGORITHM (Week 1)/4 - Subtitles (text) for Correctness Proof II (8 min).txt 8.4 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/5 - Subtitles (text) for Principles of Dynamic Programming (8 min).txt 8.2 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/5 - Subtitles (text) for Handling Ties [Advanced - Optional] (7 min).txt 7.9 kB
16 - XVI. NP-COMPLETE PROBLEMS (Week 5)/4 - Subtitles (text) for Definition and Interpretation of NP-Completeness II (8 min).txt 7.8 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/3 - Subtitles (text) for Correctness Proof - Part I (7 min).txt 7.8 kB
17 - XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 5)/3 - Subtitles (text) for Smarter Search for Vertex Cover II (8 min).txt 7.7 kB
14 - XIV. THE BELLMAN-FORD ALGORITHM (Week 4)/8 - Subtitles (text) for Internet Routing II [Optional] (7 min).txt 7.4 kB
10 - X. INTRODUCTION TO DYNAMIC PROGRAMMING (Week 3)/4 - Subtitles (text) for WIS in Path Graphs_ A Reconstruction Algorithm (7 min).txt 7.3 kB
15 - XV. ALL-PAIRS SHORTEST PATHS (Week 4)/1 - Subtitles (text) for Problem Definition (7 min).txt 7.3 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Subtitles (srt) for Data Structures_ Overview [Part I Review - Optional] (5).srt 7.2 kB
18 - XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS (Week 6)/2 - Subtitles (text) for Analysis of a Greedy Knapsack Heuristic I (7 min).txt 6.8 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/1 - Subtitles (text) for Problem Definition (6 min).txt 6.7 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Subtitles (srt) for Correctness Proof - Part II (5 min).srt 6.6 kB
13 - XIII. OPTIMAL BINARY SEARCH TREES (Week 3)/3 - Subtitles (text) for Proof of Optimal Substructure (7 min).txt 6.5 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Subtitles (srt) for Big-Oh Notation [Part I Review - Optional] (4 min).srt 6.3 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/8 - Subtitles (text) for Data Structures_ Overview [Part I Review - Optional] (5).txt 5.0 kB
4 - IV. A SCHEDULING APPLICATION (Week 1)/4 - Subtitles (text) for Correctness Proof - Part II (5 min).txt 4.6 kB
2 - II. SELECTED REVIEW FROM PART I (Week 1)/4 - Subtitles (text) for Big-Oh Notation [Part I Review - Optional] (4 min).txt 4.4 kB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Subtitles (srt) for Epilogue (1 min).srt 1.8 kB
20 - XX. THE WIDER WORLD OF ALGORITHMS (Week 6)/4 - Subtitles (text) for Epilogue (1 min).txt 1.2 kB

==查看完整文档列表==

上一个：tureckiy.gambit.2005.XviD.DVDRip.by.-FS-Media.avi2.1 GB
下一个：Errotica-Archives.com_16.01.06.Leonie.Blanco.XXX.IMAGESET-GAGBALL[rarbg] 90.6 MB

24小时热门磁力链接

Andor [HDTV 720p][Cap.205] 8145次下载 Cap HDTV 720p
Маня и Груня.2024.WEB-DL 720p.Files-x 5109次下载 2024 WEB DL
Havoc.2025.1080p.NF.WEB-DL.DDP5.1.Atmos.H.264-EniaHD.mkv 5077次下载 WEB DL DDP5
The.Super.Cube.S01E09.1080p.iQ.WEB-DL.AAC2.0.H.264-VARYG.mkv 5040次下载 WEB DL Cube
Star.Wars.Andor.S02E05.I.Have.Friends.Everywhere.1080p.DS... 4944次下载 WEB DL Star
新桥恋人.电影港地址发布页 www.dygang.me 收藏不迷路 4365次下载 me www 发布页
Night at the Museum Battle of the Smithsonian 2009 2160p... 4161次下载 KiNGDOM WEB DL
www.UIndex.org - ... 4126次下载 www MeGusta HEVC
Palma.2.2024.WEB-DL.1080p.ExKinoRay.mkv 4000次下载 WEB DL 2.2024
Guns N' Roses - Greatest Hits Live Broadcast Collection... 3915次下载 Live Remastered Hits

本周热门磁力链接

Andor [HDTV 720p][Cap.205] 8145次下载 Cap HDTV 720p
(同人CG集) [白色絵の具 (無味ムスミ)] 友達の母が巨乳で金髪の淫乱美女でした.zip 6346次下载 zip 巨乳 CG
You.S05E02.720p.HEVC.x265-MeGusta[EZTVx.to].mkv 6221次下载 S05E02 HEVC 720p
up-mod-minecraft-play-with-friends-v1-21-80-28-... 6023次下载 982108028 mod play
the.last.of.us.s02e02.1080p.web.h264-successful... 5335次下载 web last h264
异世降临.6v电影地址发布页 www.6v123.net 收藏不迷路 5220次下载 www 发布页 6v123
Opasnaya.blizost.S01.2025.WEB-DL.1080p 5127次下载 WEB DL S01
Маня и Груня.2024.WEB-DL 720p.Files-x 5109次下载 2024 WEB DL
Andor.S02E02.Sagrona.Teema.1080p.HEVC.x265-MeGu... 5100次下载 HEVC Andor mkv
Havoc.2025.1080p.NF.WEB-DL.DDP5.1.Atmos.H.264-E... 5077次下载 WEB DL DDP5

种子标签

种子评价

优质的种子 (0) 假种子 (0) 有密码 (0) 低质量 (0) 有病毒 (0) 无法下载 (0)
欢迎对种子质量进行评价。

人气女优

北川ゆい Akira COCOLO Saiko あいだももあさのくるみあまいれもんいしかわ愛里いとうしいなうさみ恭香うちだまひろかぐやひめかとりこのみかないかほくすのき琴美クミコグレースくらもとまい（葉月ありさ）さとみ中村あみしいな純菜しのざきさとみ（三沢亜也）牧本千幸（つかもと友希）眞木ありさデヴィテラパトリックドミニカともさかまいともさか愛なごみもえひなこ

分享BT种子/磁力链接

亲，你知道吗？下载的人越多速度越快，赶快把本页面分享给好友一起下载吧^_^

磁力管家