| Info hash | 7afeafb540f4ff63690f1a6517748341f6809516 |
| Last mirror activity | 21d,16:27:29 ago |
| Size | 1.93GB (1,925,417,068 bytes) |
| Added | 2016-09-26 15:39:15 |
| Views | 2539 |
| Hits | 9461 |
| ID | 3426 |
| Type | multi |
| Downloaded | 20471 time(s) |
| Uploaded by |  joecohen |
| Folder | algo-p2 |
| Num files | 111 files [See full list] |
| Mirrors | 21 complete, 0 downloading = 21 mirror(s) total [Log in to see full list] |
algo-p2 (111 files)
 book/Robert Sedgewick_ Kevin Daniel Wayne-Algorithms-Addison-Wesley (2011).pdf |
11.55MB |
| job-interview-questions/week1/01-undirected-graphs/hints.txt |
0.33kB |
| job-interview-questions/week1/01-undirected-graphs/questions.txt |
0.75kB |
| job-interview-questions/week1/02-directed-graphs/hints.txt |
0.31kB |
| job-interview-questions/week1/02-directed-graphs/questions.txt |
0.90kB |
| job-interview-questions/week2/01-minimum-spanning-trees/hints.txt |
0.43kB |
| job-interview-questions/week2/01-minimum-spanning-trees/questions.txt |
0.99kB |
| job-interview-questions/week2/02-shortest-paths/hints.txt |
0.44kB |
| job-interview-questions/week2/02-shortest-paths/questions.txt |
0.80kB |
| job-interview-questions/week3/01-maximum-flow/hints.txt |
0.50kB |
| job-interview-questions/week3/01-maximum-flow/questions.txt |
0.93kB |
| job-interview-questions/week3/02-radix-sorts/hints.txt |
0.51kB |
| job-interview-questions/week3/02-radix-sorts/questions.txt |
1.29kB |
| job-interview-questions/week5/01-tries.png |
81.61kB |
| job-interview-questions/week5/02-substring-search.png |
84.85kB |
| job-interview-questions/week6/01-regular-expressions.png |
73.83kB |
| job-interview-questions/week6/02-data-compression.png |
67.36kB |
| job-interview-questions/week7/01-reductions.png |
104.04kB |
| job-interview-questions/week7/02-intractability.png |
88.67kB |
| job-interview-questions/week7/03-linear-programming.png |
94.04kB |
| lectures/week0/Algorithms Part II 0.0 Course Introduction (922).mp4 |
44.73MB |
| lectures/week1/01-undirected-graphs/Algorithms Part II 1.0 Introduction to Graphs (932).mp4 |
25.76MB |
| lectures/week1/01-undirected-graphs/Algorithms Part II 1.1 Graph API (1447).mp4 |
21.58MB |
| lectures/week1/01-undirected-graphs/Algorithms Part II 1.2 Depth-First Search (2622).mp4 |
70.28MB |
| lectures/week1/01-undirected-graphs/Algorithms Part II 1.3 Breadth-First Search (1334).mp4 |
34.16MB |
| lectures/week1/01-undirected-graphs/Algorithms Part II 1.4 Connected Components (1856).mp4 |
25.95MB |
| lectures/week1/01-undirected-graphs/Algorithms Part II 1.5 Graph Challenges (1429).mp4 |
57.60MB |
| lectures/week1/02-directed-graphs/Algorithms Part II 2.0 Introduction to Digraphs (830).mp4 |
13.96MB |
| lectures/week1/02-directed-graphs/Algorithms Part II 2.1 Digraph API (456).mp4 |
7.56MB |
| lectures/week1/02-directed-graphs/Algorithms Part II 2.2 Digraph Search (2056).mp4 |
28.93MB |
| lectures/week1/02-directed-graphs/Algorithms Part II 2.3 Topological Sort (1254).mp4 |
28.71MB |
| lectures/week1/02-directed-graphs/Algorithms Part II 2.4 Strong Components (2022).mp4 |
27.33MB |
| lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.0 Introduction to MSTs (404).mp4 |
13.04MB |
| lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.1 Greedy Algorithm (1256).mp4 |
19.17MB |
| lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.2 Edge-Weighted Graph API (1115).mp4 |
15.86MB |
| lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.3 Kruskal's Algorithm (1228).mp4 |
17.69MB |
| lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.4 Prim's Algorithm (3315).mp4 |
70.03MB |
| lectures/week2/01-minimum-spanning-trees/Algorithms Part II 3.5 MST Context (1034).mp4 |
17.22MB |
| lectures/week2/02-shortest-paths/Algorithms Part II 4.0 Shortest Paths APIs (1051).mp4 |
29.06MB |
| lectures/week2/02-shortest-paths/Algorithms Part II 4.1 Shortest Path Properties (1446).mp4 |
35.59MB |
| lectures/week2/02-shortest-paths/Algorithms Part II 4.2 Dijkstra's Algorithm (1858).mp4 |
53.89MB |
| lectures/week2/02-shortest-paths/Algorithms Part II 4.3 Edge-Weighted DAGs (1923).mp4 |
27.78MB |
| lectures/week2/02-shortest-paths/Algorithms Part II 4.4 Negative Weights (2101).mp4 |
29.19MB |
| lectures/week3/01-maximum-flow/Algorithms Part II 5.0 Introduction to Maxflow (1033).mp4 |
15.72MB |
| lectures/week3/01-maximum-flow/Algorithms Part II 5.1 Ford-Fulkerson Algorithm (632).mp4 |
8.92MB |
| lectures/week3/01-maximum-flow/Algorithms Part II 5.2 Maxflow-Mincut Theorem (938).mp4 |
21.43MB |
| lectures/week3/01-maximum-flow/Algorithms Part II 5.3 Running Time Analysis (8-49).mp4 |
13.29MB |
| lectures/week3/01-maximum-flow/Algorithms Part II 5.4 Java Implementation (14-29).mp4 |
19.76MB |
| lectures/week3/01-maximum-flow/Algorithms Part II 5.5 Maxflow Applications (22-20).mp4 |
34.81MB |
|
|
|
Type: Course
Tags:
Bibtex:
Tags:
Bibtex:
@article{,
title= {[Coursera] Algorithms Part II },
keywords= {},
journal= {},
author= {Kevin Wayne and Robert Sedgewick (Princeton University)},
year= {},
url= {},
license= {},
abstract= {About this course: This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.
},
superseded= {},
terms= {}
}
