Kevin Wayne and Robert Sedgewick (Princeton University)

Info hash | 7afeafb540f4ff63690f1a6517748341f6809516 |

Last mirror activity | 0:43 ago |

Size | 1.93GB (1,925,417,068 bytes) |

Added | 2016-09-26 15:39:15 |

Views | 242 |

Hits | 763 |

ID | 3426 |

Downloaded | 609 time(s) |

Uploaded by | joecohen |

Folder | algo-p2 |

Num files | 111 files [See full list] |

Mirrors | 19 complete, 0 downloading = 19 mirror(s) total [Log in to see full list] |

Support

Academic Torrents!

Disable your

ad-blocker!

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 |

lectures/week3/02-radix-sorts/Algorithms Part II 6.0 Strings in Java (17-43).mp4 | 26.62MB |

lectures/week3/02-radix-sorts/Algorithms Part II 6.1 Key-Indexed Counting (12-06).mp4 | 17.57MB |

lectures/week3/02-radix-sorts/Algorithms Part II 6.2 LSD Radix Sort (15-00).mp4 | 21.71MB |

lectures/week3/02-radix-sorts/Algorithms Part II 6.3 MSD Radix Sort (13-41).mp4 | 19.68MB |

lectures/week3/02-radix-sorts/Algorithms Part II 6.4 3-way Radix Quicksort (7-22).mp4 | 12.49MB |

lectures/week3/02-radix-sorts/Algorithms Part II 6.5 Suffix Arrays (1925).mp4 | 57.98MB |

lectures/week5/01-tries/Algorithms Part II 7.0 R-way Tries (3219).mp4 | 64.75MB |

lectures/week5/01-tries/Algorithms Part II 7.1 Ternary Search Tries (2242).mp4 | 30.70MB |

lectures/week5/01-tries/Algorithms Part II 7.2 Character-Based Operations (2003).mp4 | 34.31MB |

lectures/week5/02-substring-search/Algorithms Part II 8.0 Introduction to Substring Search (642).mp4 | 9.48MB |

lectures/week5/02-substring-search/Algorithms Part II 8.1 Brute-Force Substring Search (1011).mp4 | 14.82MB |

lectures/week5/02-substring-search/Algorithms Part II 8.2 Knuth-Morris-Pratt (3314).mp4 | 47.23MB |

lectures/week5/02-substring-search/Algorithms Part II 8.3 Boyer-Moore (836).mp4 | 12.59MB |

lectures/week5/02-substring-search/Algorithms Part II 8.4 Rabin-Karp (1613).mp4 | 25.77MB |

lectures/week6/01-regular-expressions/Algorithms Part II 9.0 Regular Expressions (2003).mp4 | 32.33MB |

lectures/week6/01-regular-expressions/Algorithms Part II 9.1 REs and NFAs (1314).mp4 | 19.99MB |

lectures/week6/01-regular-expressions/Algorithms Part II 9.2 NFA Simulation (1827).mp4 | 36.97MB |

lectures/week6/01-regular-expressions/Algorithms Part II 9.3 NFA Construction (1142).mp4 | 17.37MB |

lectures/week6/01-regular-expressions/Algorithms Part II 9.4 Regular Expression Applications (2009).mp4 | 69.52MB |

lectures/week6/02-data-compression/Algorithms Part II 10.0 Introduction to Data Compression (2227).mp4 | 37.79MB |

lectures/week6/02-data-compression/Algorithms Part II 10.1 Run-Length Coding (559).mp4 | 9.55MB |

lectures/week6/02-data-compression/Algorithms Part II 10.2 Huffman Compression (2414).mp4 | 35.67MB |

lectures/week6/02-data-compression/Algorithms Part II 10.3 LZW Compression (2733).mp4 | 38.95MB |

lectures/week7/01-reductions/Algorithms Part II 11.0 Introduction to Reductions (925).mp4 | 18.30MB |

lectures/week7/01-reductions/Algorithms Part II 11.1 Designing Algorithms (813).mp4 | 12.45MB |

lectures/week7/01-reductions/Algorithms Part II 11.2 Establishing Lower Bounds (916).mp4 | 17.25MB |

lectures/week7/01-reductions/Algorithms Part II 11.3 Classifying Problems (12-45).mp4 | 19.42MB |

lectures/week7/02-linear-programming/Algorithms Part II 12.0 Brewer-'s Problem (21-15).mp4 | 31.22MB |

lectures/week7/02-linear-programming/Algorithms Part II 12.1 Simplex Algorithm (11-49).mp4 | 16.90MB |

lectures/week7/02-linear-programming/Algorithms Part II 12.2 Simplex Implementations (1621).mp4 | 83.58MB |

lectures/week7/02-linear-programming/Algorithms Part II 12.3 Linear Programming Reductions (11-46).mp4 | 21.79MB |

lectures/week7/03-intractability/Algorithms Part II 13.0 Introduction to Intractability (1700).mp4 | 36.16MB |

lectures/week7/03-intractability/Algorithms Part II 13.1 Search Problems (1056).mp4 | 22.26MB |

lectures/week7/03-intractability/Algorithms Part II 13.2 P vs. NP (1629).mp4 | 31.41MB |

lectures/week7/03-intractability/Algorithms Part II 13.3 Classifying Problems (1343).mp4 | 22.41MB |

lectures/week7/03-intractability/Algorithms Part II 13.4 NP-Completeness (1238).mp4 | 33.34MB |

lectures/week7/03-intractability/Algorithms Part II 13.5 Coping with Intractability (1401).mp4 | 22.72MB |

programming-assignments/baseball.html | 14.16kB |

programming-assignments/baseball.png | 49.49kB |

programming-assignments/boggle-gui.png | 60.56kB |

programming-assignments/boggle.html | 15.51kB |

programming-assignments/burrows.html | 22.60kB |

programming-assignments/dates.png | 10.64kB |

programming-assignments/dual-gradient.png | 83.43kB |

programming-assignments/HJoceanSmall.png | 160.28kB |

programming-assignments/HJoceanSmallEnergy.png | 93.77kB |

programming-assignments/HJoceanSmallShrunk.png | 177.98kB |

programming-assignments/HJoceanSmallVerticalSeam.png | 94.33kB |

programming-assignments/horizontal-seam.png | 161.98kB |

programming-assignments/pines.png | 9.24kB |

programming-assignments/pins.png | 8.87kB |

programming-assignments/pint.png | 9.94kB |

programming-assignments/Qu.png | 4.01kB |

programming-assignments/README.txt | 0.14kB |

programming-assignments/seamCarving.html | 13.93kB |

programming-assignments/sid.png | 8.99kB |

programming-assignments/tepee.png | 9.39kB |

programming-assignments/vertical-seam.png | 168.20kB |

programming-assignments/wordnet-fig1.png | 42.26kB |

programming-assignments/wordnet-sap.png | 10.19kB |

programming-assignments/wordnet.html | 15.20kB |

README.txt | 0.55kB |

@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= {} }