[Coursera] Algorithms: Design and Analysis, Part 2 (Stanford University) (algo2)
Stanford University

Info hashe24c15ce89cac9c380284595d1d8a475cb485e28
Last mirror activity6d,19:48:20 ago
Size1.98GB (1,984,809,211 bytes)
Added2017-03-05 01:24:05
Views1893
Hits8157
ID3598
Typemulti
Downloaded15271 time(s)
Uploaded by gravatar.com icon for user pj
Folderalgo2-004
Num files584 files
File list [Hide list]
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.mp4 14.52MB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.pdf 93.03kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.srt 18.20kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.txt 12.26kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min_0_Slides_PDF.pdf 1.48MB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.mp4 11.64MB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.pdf 104.86kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.srt 13.67kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.txt 9.12kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min_0_Slides_PDF.pdf 2.22MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.mp4 19.22MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.pdf 748.99kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.srt 32.11kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.txt 21.37kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF.pdf 214.08kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.mp4 21.23MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.pdf 746.63kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.srt 29.90kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.txt 19.96kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF.pdf 1.29MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.mp4 19.78MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.pdf 567.31kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.srt 25.90kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.txt 17.37kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_0_Slides_PDF.pdf 1.48MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.mp4 4.58MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.pdf 831.50kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.srt 6.88kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.txt 4.57kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF.pdf 676.16kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.mp4 15.19MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.pdf 472.38kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.srt 24.25kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.txt 16.00kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF.pdf 1.88MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.mp4 25.54MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.pdf 2.09MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.srt 41.13kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.txt 27.31kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF.pdf 2.40MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.mp4 22.99MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.pdf 443.11kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.srt 34.53kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.txt 22.95kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_0_Slides_PDF.pdf 2.82MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.mp4 5.13MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.pdf 197.50kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.srt 7.73kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.txt 5.19kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_0_Slides_PDF.pdf 864.67kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.mp4 20.44MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.pdf 226.20kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.srt 30.66kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.txt 20.44kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_0_Slides_PDF.pdf 2.22MB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.mp4 18.91MB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.pdf 93.48kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.srt 22.26kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.txt 14.84kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF.pdf 1.83MB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.mp4 15.69MB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.pdf 83.59kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.srt 17.36kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.txt 11.56kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min_0_Slides_PDF.pdf 1.20MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.mp4 8.17MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.pdf 114.88kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.srt 10.29kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.txt 6.90kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min_0_Slides_PDF.pdf 966.77kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.mp4 17.99MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.pdf 116.20kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.srt 22.51kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.txt 14.98kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min_0_Slides_PDF.pdf 1.71MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.mp4 9.67MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.pdf 114.82kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.srt 11.90kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.txt 7.99kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF.pdf 1.39MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.mp4 6.52MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.pdf 114.42kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.srt 7.09kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.txt 4.76kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF.pdf 973.06kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.mp4 10.12MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.pdf 123.71kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.srt 11.96kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.txt 8.12kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF.pdf 1.40MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.mp4 15.73MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.pdf 120.75kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.srt 18.60kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.txt 12.48kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min_0_Slides_PDF.pdf 1.69MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.mp4 10.48MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.pdf 107.80kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.srt 13.02kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.txt 8.71kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min_0_Slides_PDF.pdf 1.16MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.mp4 19.94MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.pdf 148.14kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.srt 24.14kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.txt 15.88kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min_0_Slides_PDF.pdf 2.58MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.mp4 10.63MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.pdf 116.43kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.srt 13.00kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.txt 8.63kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min_0_Slides_PDF.pdf 1.11MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.mp4 15.72MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.pdf 163.92kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.srt 19.90kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.txt 13.08kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF.pdf 2.25MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.mp4 20.62MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.pdf 142.39kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.srt 24.04kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.txt 16.06kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min_0_Slides_PDF.pdf 3.46MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.mp4 13.80MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.pdf 142.39kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.srt 15.66kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.txt 10.44kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min_0_Slides_PDF.pdf 3.46MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.mp4 11.55MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.pdf 107.43kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.srt 13.62kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.txt 9.01kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF.pdf 769.71kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.mp4 12.90MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.pdf 121.46kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.srt 15.29kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.txt 10.15kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF.pdf 1.63MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.mp4 13.52MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.pdf 141.80kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.srt 16.08kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.txt 10.69kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF.pdf 3.57MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.mp4 19.79MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.pdf 141.80kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.srt 23.10kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.txt 15.27kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_0_Slides_PDF.pdf 3.57MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.mp4 14.92MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.pdf 106.32kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.srt 15.30kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.txt 10.16kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_0_Slides_PDF.pdf 1.26MB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.mp4 15.87MB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.pdf 137.23kB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.srt 18.94kB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.txt 12.57kB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min_0_Slides_PDF.pdf 1.88MB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.mp4 12.51MB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.pdf 145.87kB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.srt 16.75kB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.txt 11.12kB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF.pdf 1.70MB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.mp4 15.99MB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.pdf 140.62kB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.srt 16.38kB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.txt 10.93kB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF.pdf 1.72MB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.mp4 19.08MB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.pdf 154.94kB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.srt 20.15kB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.txt 13.43kB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF.pdf 2.22MB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.mp4 23.37MB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.pdf 145.90kB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.srt 23.08kB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.txt 15.38kB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF.pdf 2.79MB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.mp4 22.55MB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.pdf 144.73kB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.srt 22.58kB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.txt 15.02kB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF.pdf 2.09MB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.mp4 14.32MB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.pdf 158.27kB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.srt 14.47kB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.txt 9.61kB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_0_Slides_PDF.pdf 3.15MB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.mp4 18.01MB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.pdf 158.27kB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.srt 17.69kB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.txt 11.75kB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_0_Slides_PDF.pdf 3.15MB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.mp4 23.74MB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.pdf 164.12kB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.srt 22.27kB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.txt 14.75kB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF.pdf 2.58MB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.mp4 21.79MB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.pdf 185.55kB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.srt 21.67kB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.txt 14.57kB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_0_Slides_PDF.pdf 3.59MB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.mp4 20.02MB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.pdf 185.55kB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.srt 20.19kB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.txt 13.54kB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_0_Slides_PDF.pdf 3.59MB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.mp4 12.46MB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.pdf 101.48kB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.srt 14.71kB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.txt 9.78kB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min_0_Slides_PDF.pdf 1.74MB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.mp4 16.09MB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.pdf 167.68kB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.srt 15.86kB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.txt 10.57kB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min_0_Slides_PDF.pdf 1.98MB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.mp4 25.90MB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.pdf 188.02kB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.srt 27.04kB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.txt 17.98kB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min_0_Slides_PDF.pdf 2.81MB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.mp4 5.78MB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.pdf 87.97kB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.srt 5.14kB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.txt 3.45kB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min_0_Slides_PDF.pdf 827.21kB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.mp4 13.95MB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.pdf 177.47kB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.srt 16.14kB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.txt 10.76kB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min_0_Slides_PDF.pdf 3.65MB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.mp4 17.56MB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.pdf 177.47kB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.srt 21.39kB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.txt 14.19kB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min_0_Slides_PDF.pdf 3.65MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.mp4 11.80MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.pdf 104.54kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.srt 13.38kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.txt 8.87kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_0_Slides_PDF.pdf 1.23MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.mp4 14.17MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.pdf 133.59kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.srt 13.93kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.txt 9.31kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF.pdf 1.75MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.mp4 15.24MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.pdf 125.26kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.srt 15.94kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.txt 10.63kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF.pdf 1.68MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.mp4 10.09MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.pdf 130.94kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.srt 11.26kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.txt 7.55kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF.pdf 1.22MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.mp4 12.87MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.pdf 109.73kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.srt 12.65kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.txt 8.46kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF.pdf 882.79kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.mp4 14.77MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.pdf 122.33kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.srt 14.75kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.txt 9.86kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min_0_Slides_PDF.pdf 1.55MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.mp4 14.27MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.pdf 123.85kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.srt 15.19kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.txt 10.12kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF.pdf 1.49MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.mp4 25.38MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.pdf 143.27kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.srt 22.07kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.txt 13.22kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min_0_Slides_PDF.pdf 788.16kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.mp4 20.48MB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.pdf 145.76kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.srt 21.60kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.txt 14.40kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min_0_Slides_PDF.pdf 2.47MB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.mp4 17.52MB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.pdf 160.58kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.srt 19.57kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.txt 13.13kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF.pdf 2.36MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.mp4 18.02MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.pdf 165.24kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.srt 20.66kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.txt 13.88kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min_0_Slides_PDF.pdf 2.04MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.mp4 14.62MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.pdf 176.65kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.srt 15.94kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.txt 10.66kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min_0_Slides_PDF.pdf 3.45MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.mp4 10.34MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.pdf 176.65kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.srt 9.94kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.txt 6.69kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF.pdf 3.45MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.mp4 14.73MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.pdf 232.52kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.srt 16.65kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.txt 11.09kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF.pdf 2.98MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.mp4 12.52MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.pdf 232.52kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.srt 15.79kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.txt 10.65kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF.pdf 2.98MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.mp4 15.89MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.pdf 121.19kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.srt 17.92kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.txt 12.08kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF.pdf 1.91MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.mp4 16.01MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.pdf 136.08kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.srt 16.87kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.txt 11.30kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min_0_Slides_PDF.pdf 2.04MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.mp4 12.70MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.pdf 193.57kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.srt 12.82kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.txt 8.73kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min_0_Slides_PDF.pdf 2.42MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.mp4 14.27MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.pdf 193.57kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.srt 16.44kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.txt 10.88kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min_0_Slides_PDF.pdf 2.42MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.mp4 13.40MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.pdf 133.30kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.srt 14.69kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.txt 9.83kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min_0_Slides_PDF.pdf 1.26MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.mp4 19.23MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.pdf 133.40kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.srt 19.06kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.txt 12.80kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min_0_Slides_PDF.pdf 2.28MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.mp4 17.53MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.pdf 128.23kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.srt 19.39kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.txt 12.95kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min_0_Slides_PDF.pdf 1.77MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.mp4 11.20MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.pdf 128.23kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.srt 11.35kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.txt 7.64kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min_0_Slides_PDF.pdf 1.77MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.mp4 9.94MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.pdf 114.32kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.srt 11.39kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.txt 7.58kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min_0_Slides_PDF.pdf 1.05MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.mp4 17.33MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.pdf 140.02kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.srt 20.23kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.txt 13.45kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min_0_Slides_PDF.pdf 1.96MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.mp4 19.81MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.pdf 131.10kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.srt 22.15kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.txt 14.88kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF.pdf 1.96MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.mp4 20.57MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.pdf 187.68kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.srt 21.07kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.txt 14.04kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min_0_Slides_PDF.pdf 2.54MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.mp4 16.24MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.pdf 171.32kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.srt 16.05kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.txt 10.76kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min_0_Slides_PDF.pdf 3.18MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.mp4 17.68MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.pdf 171.32kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.srt 17.28kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.txt 11.51kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min_0_Slides_PDF.pdf 3.18MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.mp4 21.48MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.pdf 127.50kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.srt 21.90kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.txt 14.70kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF.pdf 1.95MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.mp4 20.83MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.pdf 84.98kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.srt 20.40kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.txt 13.65kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min_0_Slides_PDF.pdf 1.84MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.mp4 17.14MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.pdf 93.39kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.srt 16.13kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.txt 10.85kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_0_Slides_PDF.pdf 2.32MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.mp4 12.77MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.pdf 93.39kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.srt 11.93kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.txt 8.05kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_0_Slides_PDF.pdf 2.32MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.mp4 14.97MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.pdf 94.90kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.srt 13.52kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.txt 9.08kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min_0_Slides_PDF.pdf 1.33MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.mp4 20.82MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.pdf 105.20kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.srt 20.88kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.txt 14.10kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF.pdf 1.15MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.mp4 13.37MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.pdf 112.25kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.srt 13.70kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.txt 9.15kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF.pdf 1.26MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.mp4 14.82MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.pdf 155.14kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.srt 14.41kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.txt 9.69kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF.pdf 2.82MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.mp4 10.87MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.pdf 155.14kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.srt 11.70kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.txt 7.89kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF.pdf 2.82MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.mp4 22.02MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.pdf 152.01kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.srt 23.72kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.txt 15.71kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF.pdf 3.08MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.mp4 18.30MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.pdf 185.24kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.srt 18.44kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.txt 12.35kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF.pdf 2.19MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.mp4 19.65MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.pdf 127.49kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.srt 21.66kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.txt 14.46kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF.pdf 2.16MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.mp4 9.37MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.pdf 155.96kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.srt 10.41kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.txt 6.95kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF.pdf 2.85MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.mp4 13.00MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.pdf 155.96kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.srt 15.51kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.txt 10.41kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF.pdf 2.85MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.mp4 16.16MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.pdf 109.17kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.srt 17.96kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.txt 12.09kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF.pdf 1.74MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.mp4 13.86MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.pdf 147.87kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.srt 15.87kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.txt 10.62kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF.pdf 1.51MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.mp4 19.61MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.pdf 141.56kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.srt 21.85kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.txt 14.68kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF.pdf 2.16MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.mp4 13.01MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.pdf 199.25kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.srt 13.04kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.txt 8.81kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF.pdf 3.21MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.mp4 13.46MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.pdf 199.25kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.srt 14.96kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.txt 10.10kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF.pdf 3.21MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.mp4 12.81MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.pdf 113.60kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.srt 14.80kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.txt 9.94kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min_0_Slides_PDF.pdf 2.79MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.mp4 15.19MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.pdf 113.60kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.srt 18.13kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.txt 12.22kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min_0_Slides_PDF.pdf 2.79MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.mp4 20.60MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.pdf 124.10kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.srt 22.91kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.txt 15.36kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min_0_Slides_PDF.pdf 1.80MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.mp4 22.36MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.pdf 206.99kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.srt 24.82kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.txt 16.60kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min_0_Slides_PDF.pdf 2.38MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.mp4 22.67MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.pdf 145.55kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.srt 22.01kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.txt 14.73kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF.pdf 2.59MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.mp4 23.64MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.pdf 164.51kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.srt 20.42kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.txt 13.57kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min_0_Slides_PDF.pdf 5.40MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.mp4 21.98MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.pdf 164.51kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.srt 20.30kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.txt 13.66kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF.pdf 5.40MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.mp4 17.66MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.pdf 164.51kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.srt 17.51kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.txt 11.74kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF.pdf 5.40MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/04_Epilogue_1_min.mp4 1.87MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/04_Epilogue_1_min.srt 1.91kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/04_Epilogue_1_min.txt 1.27kB
Assignments.html 100.46kB
Assignments/0_Problem_Set_1/0_Problem_Set_1.html 147.21kB
Assignments/0_Problem_Set_1/links.txt 1.39kB
Assignments/10_Problem_Set_6/10_Problem_Set_6.html 103.90kB
Assignments/10_Problem_Set_6/links.txt 1.39kB
Assignments/11_Programming_Assignment_6/11_Programming_Assignment_6.html 49.08kB
Assignments/11_Programming_Assignment_6/2sat1.txt 1.28MB
Assignments/11_Programming_Assignment_6/2sat2.txt 2.78MB
Assignments/11_Programming_Assignment_6/2sat3.txt 5.78MB
Assignments/11_Programming_Assignment_6/2sat4.txt 8.78MB
Assignments/11_Programming_Assignment_6/2sat5.txt 11.78MB
Assignments/11_Programming_Assignment_6/2sat6.txt 14.78MB
Assignments/11_Programming_Assignment_6/links.txt 1.76kB
Assignments/11_Programming_Assignment_6/zip_page.html 49.08kB
Assignments/1_Programming_Assignment_1/1_Programming_Assignment_1.html 43.87kB
Assignments/1_Programming_Assignment_1/edges.txt 28.29kB
Assignments/1_Programming_Assignment_1/jobs.txt 58.40kB
Assignments/1_Programming_Assignment_1/links.txt 1.51kB
Assignments/1_Programming_Assignment_1/zip_page.html 43.87kB
Assignments/2_Problem_Set_2/2_Problem_Set_2.html 95.48kB
Assignments/2_Problem_Set_2/links.txt 1.39kB
Assignments/3_Programming_Assignment_2/3_Programming_Assignment_2.html 56.14kB
Assignments/3_Programming_Assignment_2/clustering1.txt 1.55MB
Assignments/3_Programming_Assignment_2/clustering_big.txt 9.80MB
Assignments/3_Programming_Assignment_2/links.txt 1.52kB
Assignments/3_Programming_Assignment_2/zip_page.html 56.14kB
Assignments/4_Problem_Set_3/4_Problem_Set_3.html 115.16kB
Assignments/4_Problem_Set_3/links.txt 1.39kB
Assignments/5_Programming_Assignment_3/5_Programming_Assignment_3.html 42.36kB
Assignments/5_Programming_Assignment_3/knapsack1.txt 0.99kB
Assignments/5_Programming_Assignment_3/knapsack_big.txt 25.57kB
Assignments/5_Programming_Assignment_3/links.txt 1.52kB
Assignments/5_Programming_Assignment_3/zip_page.html 42.36kB
Assignments/6_Problem_Set_4/6_Problem_Set_4.html 106.09kB
Assignments/6_Problem_Set_4/links.txt 1.39kB
Assignments/7_Programming_Assignment_4/7_Programming_Assignment_4.html 51.83kB
Assignments/7_Programming_Assignment_4/g1.txt 509.52kB
Assignments/7_Programming_Assignment_4/g2.txt 509.67kB
Assignments/7_Programming_Assignment_4/g3.txt 509.50kB
Assignments/7_Programming_Assignment_4/large.txt 13.79MB
Assignments/7_Programming_Assignment_4/links.txt 1.62kB
Assignments/7_Programming_Assignment_4/zip_page.html 51.83kB
Assignments/8_Problem_Set_5/8_Problem_Set_5.html 79.94kB
Assignments/8_Problem_Set_5/links.txt 1.39kB
Assignments/9_Programming_Assignment_5/9_Programming_Assignment_5.html 53.85kB
Assignments/9_Programming_Assignment_5/links.txt 1.49kB
Assignments/9_Programming_Assignment_5/tsp.txt 0.55kB
Assignments/9_Programming_Assignment_5/zip_page.html 53.85kB
CourseLogisticsAssessment/CourseLogisticsAssessment.html 36.16kB
CourseLogisticsAssessment/links.txt 1.37kB
DiscussionForums/DiscussionForums.html 60.61kB
DiscussionForums/links.txt 1.26kB
Final Exam.html 35.13kB
FinalExam/0_Final_Exam/0_Final_Exam.html 32.50kB
FinalExam/0_Final_Exam/links.txt 1.45kB
Home/Home.html 63.51kB
Home/links.txt 2.40kB
Syllabus/Syllabus.html 39.38kB
Syllabus/links.txt 1.37kB
TheoryOptionalProblems/TheoryOptionalProblems.html 89.45kB
TheoryOptionalProblems/links.txt 1.46kB
Tips/Tips.html 36.83kB
Tips/links.txt 1.37kB
assignment_home.html 31.45kB
course_home.html 63.56kB
entered_login.html 1.37MB
Mirrors11 complete, 0 downloading = 11 mirror(s) total [Log in to see full list]


Send Feedback Start
   0.000003
DB Connect
   0.000432
Lookup hash in DB
   0.000830
Get torrent details
   0.000862
Get torrent details, finished
   0.000867
Get authors
   0.000032
Parse bibtex
   0.000131
Write header
   0.000643
get stars
   0.000571
target tab
   0.000015
Request peers
   0.001535
Write table
   0.013022
geoloc peers
   0.026993
render right panel
   0.000015
render ads
   0.000056
fetch current hosters
   0.001268
Done