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

Info hashe24c15ce89cac9c380284595d1d8a475cb485e28
Last mirror activity3:47 ago
Size1.98GB (1,984,809,211 bytes)
Added2017-03-05 01:24:05
Views950
Hits3921
ID3598
Downloaded2715 time(s)
Uploaded bygravatar.com icon for user pj
Folderalgo2-004
Num files584 files
File list
[Hide list]
PathSize
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.mp414.52MB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.pdf93.03kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.srt18.20kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min.txt12.26kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/01_Application-_Internet_Routing_11_min_0_Slides_PDF.pdf1.48MB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.mp411.64MB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.pdf104.86kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.srt13.67kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min.txt9.12kB
01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/02_Application-_Sequence_Alignment_9_min_0_Slides_PDF.pdf2.22MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.mp419.22MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.pdf748.99kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.srt32.11kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min.txt21.37kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF.pdf214.08kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.mp421.23MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.pdf746.63kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.srt29.90kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.txt19.96kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF.pdf1.29MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.mp419.78MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.pdf567.31kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.srt25.90kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.txt17.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.pdf1.48MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.mp44.58MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.pdf831.50kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.srt6.88kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.txt4.57kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF.pdf676.16kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.mp415.19MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.pdf472.38kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.srt24.25kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min.txt16.00kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF.pdf1.88MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.mp425.54MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.pdf2.09MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.srt41.13kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.txt27.31kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF.pdf2.40MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.mp422.99MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.pdf443.11kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.srt34.53kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.txt22.95kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_0_Slides_PDF.pdf2.82MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.mp45.13MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.pdf197.50kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.srt7.73kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.txt5.19kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_0_Slides_PDF.pdf864.67kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.mp420.44MB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.pdf226.20kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.srt30.66kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.txt20.44kB
02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_0_Slides_PDF.pdf2.22MB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.mp418.91MB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.pdf93.48kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.srt22.26kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min.txt14.84kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF.pdf1.83MB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.mp415.69MB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.pdf83.59kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.srt17.36kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min.txt11.56kB
03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/02_Application-_Optimal_Caching_11_min_0_Slides_PDF.pdf1.20MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.mp48.17MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.pdf114.88kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.srt10.29kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min.txt6.90kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/01_Problem_Definition_6_min_0_Slides_PDF.pdf966.77kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.mp417.99MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.pdf116.20kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.srt22.51kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min.txt14.98kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/02_A_Greedy_Algorithm_13_min_0_Slides_PDF.pdf1.71MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.mp49.67MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.pdf114.82kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.srt11.90kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min.txt7.99kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF.pdf1.39MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.mp46.52MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.pdf114.42kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.srt7.09kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min.txt4.76kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF.pdf973.06kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.mp410.12MB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.pdf123.71kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.srt11.96kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min.txt8.12kB
04_IV._A_SCHEDULING_APPLICATION_Week_1/05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF.pdf1.40MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.mp415.73MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.pdf120.75kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.srt18.60kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min.txt12.48kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/01_MST_Problem_Definition_11_min_0_Slides_PDF.pdf1.69MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.mp410.48MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.pdf107.80kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.srt13.02kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min.txt8.71kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/02_Prims_MST_Algorithm_8_min_0_Slides_PDF.pdf1.16MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.mp419.94MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.pdf148.14kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.srt24.14kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min.txt15.88kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/03_Correctness_Proof_I_16_min_0_Slides_PDF.pdf2.58MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.mp410.63MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.pdf116.43kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.srt13.00kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min.txt8.63kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/04_Correctness_Proof_II_8_min_0_Slides_PDF.pdf1.11MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.mp415.72MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.pdf163.92kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.srt19.90kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.txt13.08kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF.pdf2.25MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.mp420.62MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.pdf142.39kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.srt24.04kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min.txt16.06kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/06_Fast_Implementation_I_15_min_0_Slides_PDF.pdf3.46MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.mp413.80MB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.pdf142.39kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.srt15.66kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min.txt10.44kB
05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/07_Fast_Implementation_II_10_min_0_Slides_PDF.pdf3.46MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.mp411.55MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.pdf107.43kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.srt13.62kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min.txt9.01kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF.pdf769.71kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.mp412.90MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.pdf121.46kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.srt15.29kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min.txt10.15kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF.pdf1.63MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.mp413.52MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.pdf141.80kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.srt16.08kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.txt10.69kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF.pdf3.57MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.mp419.79MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.pdf141.80kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.srt23.10kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.txt15.27kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_0_Slides_PDF.pdf3.57MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.mp414.92MB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.pdf106.32kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.srt15.30kB
06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.txt10.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.pdf1.26MB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.mp415.87MB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.pdf137.23kB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.srt18.94kB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min.txt12.57kB
07_VII._CLUSTERING_Week_2/01_Application_to_Clustering_12_min_0_Slides_PDF.pdf1.88MB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.mp412.51MB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.pdf145.87kB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.srt16.75kB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min.txt11.12kB
07_VII._CLUSTERING_Week_2/02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF.pdf1.70MB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.mp415.99MB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.pdf140.62kB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.srt16.38kB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min.txt10.93kB
08_VIII._ADVANCED_UNION-FIND_Week_2/01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF.pdf1.72MB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.mp419.08MB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.pdf154.94kB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.srt20.15kB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min.txt13.43kB
08_VIII._ADVANCED_UNION-FIND_Week_2/02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF.pdf2.22MB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.mp423.37MB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.pdf145.90kB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.srt23.08kB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.txt15.38kB
08_VIII._ADVANCED_UNION-FIND_Week_2/03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF.pdf2.79MB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.mp422.55MB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.pdf144.73kB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.srt22.58kB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min.txt15.02kB
08_VIII._ADVANCED_UNION-FIND_Week_2/04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF.pdf2.09MB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.mp414.32MB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.pdf158.27kB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.srt14.47kB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.txt9.61kB
08_VIII._ADVANCED_UNION-FIND_Week_2/05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_0_Slides_PDF.pdf3.15MB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.mp418.01MB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.pdf158.27kB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.srt17.69kB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.txt11.75kB
08_VIII._ADVANCED_UNION-FIND_Week_2/06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_0_Slides_PDF.pdf3.15MB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.mp423.74MB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.pdf164.12kB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.srt22.27kB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min.txt14.75kB
08_VIII._ADVANCED_UNION-FIND_Week_2/07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF.pdf2.58MB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.mp421.79MB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.pdf185.55kB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.srt21.67kB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.txt14.57kB
08_VIII._ADVANCED_UNION-FIND_Week_2/08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_0_Slides_PDF.pdf3.59MB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.mp420.02MB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.pdf185.55kB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.srt20.19kB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.txt13.54kB
08_VIII._ADVANCED_UNION-FIND_Week_2/09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_0_Slides_PDF.pdf3.59MB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.mp412.46MB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.pdf101.48kB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.srt14.71kB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min.txt9.78kB
09_IX._HUFFMAN_CODES_Week_2/01_Introduction_and_Motivation_9_min_0_Slides_PDF.pdf1.74MB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.mp416.09MB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.pdf167.68kB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.srt15.86kB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min.txt10.57kB
09_IX._HUFFMAN_CODES_Week_2/02_Problem_Definition_10_min_0_Slides_PDF.pdf1.98MB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.mp425.90MB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.pdf188.02kB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.srt27.04kB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min.txt17.98kB
09_IX._HUFFMAN_CODES_Week_2/03_A_Greedy_Algorithm_17_min_0_Slides_PDF.pdf2.81MB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.mp45.78MB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.pdf87.97kB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.srt5.14kB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min.txt3.45kB
09_IX._HUFFMAN_CODES_Week_2/04_A_More_Complex_Example_4_min_0_Slides_PDF.pdf827.21kB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.mp413.95MB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.pdf177.47kB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.srt16.14kB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min.txt10.76kB
09_IX._HUFFMAN_CODES_Week_2/05_Correctness_Proof_I_10_min_0_Slides_PDF.pdf3.65MB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.mp417.56MB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.pdf177.47kB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.srt21.39kB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min.txt14.19kB
09_IX._HUFFMAN_CODES_Week_2/06_Correctness_Proof_II_13_min_0_Slides_PDF.pdf3.65MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.mp411.80MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.pdf104.54kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.srt13.38kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.txt8.87kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_0_Slides_PDF.pdf1.23MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.mp414.17MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.pdf133.59kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.srt13.93kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.txt9.31kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF.pdf1.75MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.mp415.24MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.pdf125.26kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.srt15.94kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.txt10.63kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF.pdf1.68MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.mp410.09MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.pdf130.94kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.srt11.26kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.txt7.55kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF.pdf1.22MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.mp412.87MB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.pdf109.73kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.srt12.65kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min.txt8.46kB
10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF.pdf882.79kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.mp414.77MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.pdf122.33kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.srt14.75kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min.txt9.86kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/01_The_Knapsack_Problem_10_min_0_Slides_PDF.pdf1.55MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.mp414.27MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.pdf123.85kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.srt15.19kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min.txt10.12kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF.pdf1.49MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.mp425.38MB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.pdf143.27kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.srt22.07kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min.txt13.22kB
11_XI._THE_KNAPSACK_PROBLEM_Week_3/03_Example_Review_-_Optional_14_min_0_Slides_PDF.pdf788.16kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.mp420.48MB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.pdf145.76kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.srt21.60kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min.txt14.40kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/01_Optimal_Substructure_14_min_0_Slides_PDF.pdf2.47MB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.mp417.52MB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.pdf160.58kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.srt19.57kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min.txt13.13kB
12_XII._SEQUENCE_ALIGNMENT_Week_3/02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF.pdf2.36MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.mp418.02MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.pdf165.24kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.srt20.66kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min.txt13.88kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/01_Problem_Definition_12_min_0_Slides_PDF.pdf2.04MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.mp414.62MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.pdf176.65kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.srt15.94kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min.txt10.66kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/02_Optimal_Substructure_9_min_0_Slides_PDF.pdf3.45MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.mp410.34MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.pdf176.65kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.srt9.94kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min.txt6.69kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF.pdf3.45MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.mp414.73MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.pdf232.52kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.srt16.65kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min.txt11.09kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF.pdf2.98MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.mp412.52MB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.pdf232.52kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.srt15.79kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min.txt10.65kB
13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF.pdf2.98MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.mp415.89MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.pdf121.19kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.srt17.92kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min.txt12.08kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF.pdf1.91MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.mp416.01MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.pdf136.08kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.srt16.87kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min.txt11.30kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/02_Optimal_Substructure_11_min_0_Slides_PDF.pdf2.04MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.mp412.70MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.pdf193.57kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.srt12.82kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min.txt8.73kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/03_The_Basic_Algorithm_I_9_min_0_Slides_PDF.pdf2.42MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.mp414.27MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.pdf193.57kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.srt16.44kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min.txt10.88kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/04_The_Basic_Algorithm_II_11_min_0_Slides_PDF.pdf2.42MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.mp413.40MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.pdf133.30kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.srt14.69kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min.txt9.83kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/05_Detecting_Negative_Cycles_9_min_0_Slides_PDF.pdf1.26MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.mp419.23MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.pdf133.40kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.srt19.06kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min.txt12.80kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/06_A_Space_Optimization_12_min_0_Slides_PDF.pdf2.28MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.mp417.53MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.pdf128.23kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.srt19.39kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min.txt12.95kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/07_Internet_Routing_I_Optional_11_min_0_Slides_PDF.pdf1.77MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.mp411.20MB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.pdf128.23kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.srt11.35kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min.txt7.64kB
14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/08_Internet_Routing_II_Optional_7_min_0_Slides_PDF.pdf1.77MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.mp49.94MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.pdf114.32kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.srt11.39kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min.txt7.58kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/01_Problem_Definition_7_min_0_Slides_PDF.pdf1.05MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.mp417.33MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.pdf140.02kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.srt20.23kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min.txt13.45kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/02_Optimal_Substructure_12_min_0_Slides_PDF.pdf1.96MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.mp419.81MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.pdf131.10kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.srt22.15kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min.txt14.88kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF.pdf1.96MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.mp420.57MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.pdf187.68kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.srt21.07kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min.txt14.04kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/04_A_Reweighting_Technique_14_min_0_Slides_PDF.pdf2.54MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.mp416.24MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.pdf171.32kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.srt16.05kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min.txt10.76kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/05_Johnsons_Algorithm_I_11_min_0_Slides_PDF.pdf3.18MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.mp417.68MB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.pdf171.32kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.srt17.28kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min.txt11.51kB
15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/06_Johnsons_Algorithm_II_11_min_0_Slides_PDF.pdf3.18MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.mp421.48MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.pdf127.50kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.srt21.90kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min.txt14.70kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF.pdf1.95MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.mp420.83MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.pdf84.98kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.srt20.40kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min.txt13.65kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/02_Reductions_and_Completeness_14_min_0_Slides_PDF.pdf1.84MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.mp417.14MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.pdf93.39kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.srt16.13kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.txt10.85kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_0_Slides_PDF.pdf2.32MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.mp412.77MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.pdf93.39kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.srt11.93kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.txt8.05kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_0_Slides_PDF.pdf2.32MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.mp414.97MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.pdf94.90kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.srt13.52kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min.txt9.08kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/05_The_P_vs._NP_Question_9_min_0_Slides_PDF.pdf1.33MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.mp420.82MB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.pdf105.20kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.srt20.88kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.txt14.10kB
16_XVI._NP-COMPLETE_PROBLEMS_Week_5/06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF.pdf1.15MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.mp413.37MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.pdf112.25kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.srt13.70kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min.txt9.15kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF.pdf1.26MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.mp414.82MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.pdf155.14kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.srt14.41kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min.txt9.69kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF.pdf2.82MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.mp410.87MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.pdf155.14kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.srt11.70kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min.txt7.89kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF.pdf2.82MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.mp422.02MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.pdf152.01kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.srt23.72kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min.txt15.71kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF.pdf3.08MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.mp418.30MB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.pdf185.24kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.srt18.44kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.txt12.35kB
17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF.pdf2.19MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.mp419.65MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.pdf127.49kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.srt21.66kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min.txt14.46kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF.pdf2.16MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.mp49.37MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.pdf155.96kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.srt10.41kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.txt6.95kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF.pdf2.85MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.mp413.00MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.pdf155.96kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.srt15.51kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.txt10.41kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF.pdf2.85MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.mp416.16MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.pdf109.17kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.srt17.96kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.txt12.09kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF.pdf1.74MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.mp413.86MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.pdf147.87kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.srt15.87kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min.txt10.62kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF.pdf1.51MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.mp419.61MB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.pdf141.56kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.srt21.85kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.txt14.68kB
18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF.pdf2.16MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.mp413.01MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.pdf199.25kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.srt13.04kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min.txt8.81kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF.pdf3.21MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.mp413.46MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.pdf199.25kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.srt14.96kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min.txt10.10kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF.pdf3.21MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.mp412.81MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.pdf113.60kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.srt14.80kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min.txt9.94kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/03_Principles_of_Local_Search_I_9_min_0_Slides_PDF.pdf2.79MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.mp415.19MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.pdf113.60kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.srt18.13kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min.txt12.22kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/04_Principles_of_Local_Search_II_10_min_0_Slides_PDF.pdf2.79MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.mp420.60MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.pdf124.10kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.srt22.91kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min.txt15.36kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/05_The_2-SAT_Problem_15_min_0_Slides_PDF.pdf1.80MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.mp422.36MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.pdf206.99kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.srt24.82kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min.txt16.60kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/06_Random_Walks_on_a_Line_16_min_0_Slides_PDF.pdf2.38MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.mp422.67MB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.pdf145.55kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.srt22.01kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min.txt14.73kB
19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF.pdf2.59MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.mp423.64MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.pdf164.51kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.srt20.42kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min.txt13.57kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/01_Stable_Matching_Optional_15_min_0_Slides_PDF.pdf5.40MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.mp421.98MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.pdf164.51kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.srt20.30kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.txt13.66kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF.pdf5.40MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.mp417.66MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.pdf164.51kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.srt17.51kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min.txt11.74kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF.pdf5.40MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/04_Epilogue_1_min.mp41.87MB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/04_Epilogue_1_min.srt1.91kB
20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/04_Epilogue_1_min.txt1.27kB
Assignments.html100.46kB
Assignments/0_Problem_Set_1/0_Problem_Set_1.html147.21kB
Assignments/0_Problem_Set_1/links.txt1.39kB
Assignments/10_Problem_Set_6/10_Problem_Set_6.html103.90kB
Assignments/10_Problem_Set_6/links.txt1.39kB
Assignments/11_Programming_Assignment_6/11_Programming_Assignment_6.html49.08kB
Assignments/11_Programming_Assignment_6/2sat1.txt1.28MB
Assignments/11_Programming_Assignment_6/2sat2.txt2.78MB
Assignments/11_Programming_Assignment_6/2sat3.txt5.78MB
Assignments/11_Programming_Assignment_6/2sat4.txt8.78MB
Assignments/11_Programming_Assignment_6/2sat5.txt11.78MB
Assignments/11_Programming_Assignment_6/2sat6.txt14.78MB
Assignments/11_Programming_Assignment_6/links.txt1.76kB
Assignments/11_Programming_Assignment_6/zip_page.html49.08kB
Assignments/1_Programming_Assignment_1/1_Programming_Assignment_1.html43.87kB
Assignments/1_Programming_Assignment_1/edges.txt28.29kB
Assignments/1_Programming_Assignment_1/jobs.txt58.40kB
Assignments/1_Programming_Assignment_1/links.txt1.51kB
Assignments/1_Programming_Assignment_1/zip_page.html43.87kB
Assignments/2_Problem_Set_2/2_Problem_Set_2.html95.48kB
Assignments/2_Problem_Set_2/links.txt1.39kB
Assignments/3_Programming_Assignment_2/3_Programming_Assignment_2.html56.14kB
Assignments/3_Programming_Assignment_2/clustering1.txt1.55MB
Assignments/3_Programming_Assignment_2/clustering_big.txt9.80MB
Assignments/3_Programming_Assignment_2/links.txt1.52kB
Assignments/3_Programming_Assignment_2/zip_page.html56.14kB
Assignments/4_Problem_Set_3/4_Problem_Set_3.html115.16kB
Assignments/4_Problem_Set_3/links.txt1.39kB
Assignments/5_Programming_Assignment_3/5_Programming_Assignment_3.html42.36kB
Assignments/5_Programming_Assignment_3/knapsack1.txt0.99kB
Assignments/5_Programming_Assignment_3/knapsack_big.txt25.57kB
Assignments/5_Programming_Assignment_3/links.txt1.52kB
Assignments/5_Programming_Assignment_3/zip_page.html42.36kB
Assignments/6_Problem_Set_4/6_Problem_Set_4.html106.09kB
Assignments/6_Problem_Set_4/links.txt1.39kB
Assignments/7_Programming_Assignment_4/7_Programming_Assignment_4.html51.83kB
Assignments/7_Programming_Assignment_4/g1.txt509.52kB
Assignments/7_Programming_Assignment_4/g2.txt509.67kB
Assignments/7_Programming_Assignment_4/g3.txt509.50kB
Assignments/7_Programming_Assignment_4/large.txt13.79MB
Assignments/7_Programming_Assignment_4/links.txt1.62kB
Assignments/7_Programming_Assignment_4/zip_page.html51.83kB
Assignments/8_Problem_Set_5/8_Problem_Set_5.html79.94kB
Assignments/8_Problem_Set_5/links.txt1.39kB
Assignments/9_Programming_Assignment_5/9_Programming_Assignment_5.html53.85kB
Assignments/9_Programming_Assignment_5/links.txt1.49kB
Assignments/9_Programming_Assignment_5/tsp.txt0.55kB
Assignments/9_Programming_Assignment_5/zip_page.html53.85kB
CourseLogisticsAssessment/CourseLogisticsAssessment.html36.16kB
CourseLogisticsAssessment/links.txt1.37kB
DiscussionForums/DiscussionForums.html60.61kB
DiscussionForums/links.txt1.26kB
Final Exam.html35.13kB
FinalExam/0_Final_Exam/0_Final_Exam.html32.50kB
FinalExam/0_Final_Exam/links.txt1.45kB
Home/Home.html63.51kB
Home/links.txt2.40kB
Syllabus/Syllabus.html39.38kB
Syllabus/links.txt1.37kB
TheoryOptionalProblems/TheoryOptionalProblems.html89.45kB
TheoryOptionalProblems/links.txt1.46kB
Tips/Tips.html36.83kB
Tips/links.txt1.37kB
assignment_home.html31.45kB
course_home.html63.56kB
entered_login.html1.37MB
Mirrors44 complete, 0 downloading = 44 mirror(s) total [Log in to see full list]

Report