Course Modules
Lecture 1: Runtime Analysis (31 January 2024)
Lecture 1: Runtime Analysis (31 January 2024)
Module Completed
Module In Progress
Module Locked
-
Context Module Sub HeaderTip: Try to code the algorithms discussed in each lecture on your own (without relying on the video). You are ready to move to the next lecture only if you can do this comfortably.Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired to Watch: Peak Finding Required to Watch: Peak FindingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired to Watch: Models of Computation Required to Watch: Models of ComputationScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Chapter 0 Required Reading: Chapter 0Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: What is an algorithm? Recommended to Watch: What is an algorithm?Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Big O Notation Recommended to Watch: Big O NotationScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Asymptotic Notation Recommended to Watch: Asymptotic NotationScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 2: Merge Sort (1 February 2024)
Lecture 2: Merge Sort (1 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlRequired Background: Linked Lists Required Background: Linked ListsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Background: Implementing Linked Lists in C++ Required Background: Implementing Linked Lists in C++Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Background: Binary Search Required Background: Binary SearchScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Sections 1.1 to 1.4 Required Reading: Sections 1.1 to 1.4Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Insertion Sort and Merge Sort Recommended to Watch: Insertion Sort and Merge SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 3: Heaps and Heap Sort (2 February 2024)
Lecture 3: Heaps and Heap Sort (2 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 6 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Binary Heaps Recommended to Watch: Binary HeapsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Heaps and Heap Sort Recommended to Watch: Heaps and Heap SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: An example of Heap Sort Recommended to Watch: An example of Heap SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: What is a binary heap? Recommended to Watch: What is a binary heap?Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: An example of Heap Sort (not the variant we covered) Recommended to Watch: An example of Heap Sort (not the variant we covered)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Binary Heap on Wikipedia Recommended to Read: Binary Heap on WikipediaScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Binomial and Fibonacci Heaps (Not part of the syllabus, More advanced than COMP 3711H) Recommended to Watch: Binomial and Fibonacci Heaps (Not part of the syllabus, More advanced than COMP 3711H)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 1: Counting Inversions (6 February 2024)
TA Session 1: Counting Inversions (6 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlRequired Watching: O(n log n) Algorithm for Counting Inversions Required Watching: O(n log n) Algorithm for Counting InversionsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Reading: Inversion count in Array using Merge Sort Recommended Reading: Inversion count in Array using Merge SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 4: Quick Sort, Quick Select and Median (7 February 2024)
Lecture 4: Quick Sort, Quick Select and Median (7 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 7 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Median Finding (second part of the lecture) Recommended to Watch: Median Finding (second part of the lecture)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Quick Sort Recommended to Watch: Quick SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Another short lecture on Quick Sort Recommended to Watch: Another short lecture on Quick SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: An Example of In-place Quick Sort Recommended to Watch: An Example of In-place Quick SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Another Example of Quick Sort Recommended to Watch: Another Example of Quick SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: An analysis of Randomized Quick Sort (second part of the lecture) Recommended to Watch: An analysis of Randomized Quick Sort (second part of the lecture)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 5: Solving Recurrences (8 February 2024)
Lecture 5: Solving Recurrences (8 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 4 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Master Theorem Recommended to Watch: Master TheoremScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Proof of Master Theorem Recommended to Watch: Proof of Master TheoremScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Recursion Tree Method Recommended to Watch: Recursion Tree MethodScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Master Theorem Recommended to Watch: Master TheoremScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Solving Recurrences (Great lecture, terrible video quality) Recommended to Watch: Solving Recurrences (Great lecture, terrible video quality)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 6: Radix Sort and Binary Search Trees (9 February 2024)
Lecture 6: Radix Sort and Binary Search Trees (9 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 8 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Counting and Radix Sort Recommended to Watch: Counting and Radix SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Binary Search Trees Recommended to Watch: Binary Search TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Binary Search Tree on Wikipedia Recommended to Read: Binary Search Tree on WikipediaScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Radix Sort on Wikipedia Recommended to Read: Radix Sort on WikipediaScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 7: Implementing Binary Search Trees (14 February 2024)
Lecture 7: Implementing Binary Search Trees (14 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 12 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRecommended Reading: Chapter 14 of CLRS (When you see Red-black trees, just think of BSTs)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: An Implementation of BST in C++ Recommended to Watch: An Implementation of BST in C++Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Binary Search Trees Recommended to Watch: Binary Search TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 8: AVL Trees (15 February 2024)
Lecture 8: AVL Trees (15 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: AVL Trees Recommended to Watch: AVL TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: AVL Trees Simply Explained Recommended to Watch: AVL Trees Simply ExplainedScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRecommended Reading: Chapter 13 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 9: Treaps and Randomized Quick Sort (16 February 2024)
Lecture 9: Treaps and Randomized Quick Sort (16 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlRequired Background: Discrete Probability Required Background: Discrete ProbabilityScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Background: Appendix C of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Treaps (Skip Lists are optional, but recommended) Required Reading: Treaps (Skip Lists are optional, but recommended)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Treaps and Skip Lists Recommended to Watch: Treaps and Skip ListsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Randomized Quick Sort Recommended to Watch: Randomized Quick SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Coding Practice 1 - Deadline: 4 March 2024
Coding Practice 1 - Deadline: 4 March 2024
Module Completed
Module In Progress
Module Locked
-
Context Module Sub HeaderSee the announcement about coding practicesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlLink to the Problemset Link to the ProblemsetScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 2: Binary Search (20 February 2024)
TA Session 2: Binary Search (20 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlRequired Background: Binary Search Required Background: Binary SearchScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired to Watch: Bug in Binary Search Required to Watch: Bug in Binary SearchScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: ITMO Academy - Binary Search (Requires creating an account on codeforces and enrolling under EDU) Recommended Practice: ITMO Academy - Binary Search (Requires creating an account on codeforces and enrolling under EDU)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 10: Divide and Conquer (21 February 2024)
Lecture 10: Divide and Conquer (21 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Solving T(n) = 2 T(n/2) + n lg n Required Reading: Solving T(n) = 2 T(n/2) + n lg nScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 4 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Reading: Recursion Recommended Reading: RecursionScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Divide and Conquer (Think Like a Programmer) Recommended to Watch: Divide and Conquer (Think Like a Programmer)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Divide and Conquer (1) Recommended to Watch: Divide and Conquer (1)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Divide and Conquer (2) Recommended to Watch: Divide and Conquer (2)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 11: Greedy Algorithms (22 February 2024)
Lecture 11: Greedy Algorithms (22 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Sections 4.1 to 4.3 of Erickson Required Reading: Sections 4.1 to 4.3 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read/Watch: Introduction to Greedy Algorithms Recommended to Read/Watch: Introduction to Greedy AlgorithmsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Greedy Algorithms Recommended to Watch: Greedy AlgorithmsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 12: Huffman Coding (23 February 2024)
Lecture 12: Huffman Coding (23 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: How Computers Compress Text Recommended to Watch: How Computers Compress TextScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Huffman Coding Recommended to Watch: Huffman CodingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Chapter 4 of Erickson (including 4.4 and 4.5) Required Reading: Chapter 4 of Erickson (including 4.4 and 4.5)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 3: Two Pointers (27 February 2024)
TA Session 3: Two Pointers (27 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: ITMO Academy - Two Pointers Method (Requires creating an account on codeforces and enrolling under EDU) Recommended Practice: ITMO Academy - Two Pointers Method (Requires creating an account on codeforces and enrolling under EDU)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: Segments with Small Set Recommended Practice: Segments with Small SetScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: Segments with Small Spread Recommended Practice: Segments with Small SpreadScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Two Pointer Technique Recommended to Watch: Two Pointer TechniqueScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 13: DFS and BFS (28 February 2024)
Lecture 13: DFS and BFS (28 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlRequired Background: Chapter 5 of Erickson Required Background: Chapter 5 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 22 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: DFS and Topological Sort Recommended to Watch: DFS and Topological SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: A Visualization of DFS Recommended to Watch: A Visualization of DFSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: BFS Recommended to Watch: BFSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: A Visualization of BFS Recommended to Watch: A Visualization of BFSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Feedback Form (29 February 2024)
Feedback Form (29 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlPlease fill out this form to let us know about your experience with COMP 3711H thus far. Please fill out this form to let us know about your experience with COMP 3711H thus far.Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 14: Topological Sort (29 February 2024)
Lecture 14: Topological Sort (29 February 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 22 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Topological Sort Algorithm Recommended to Watch: Topological Sort AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 15: Strongly Connected Components and Dijkstra's Algorithm (1 March 2024)
Lecture 15: Strongly Connected Components and Dijkstra's Algorithm (1 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderImportant: See Lecture 19 for a correction regarding cross edgesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Chapter 6 of Erickson Required Reading: Chapter 6 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Section 24.3 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Tarjan's Algorithm Recommended to Read: Tarjan's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Tarjan's Strongly Connected Components Algorithm Recommended to Watch: Tarjan's Strongly Connected Components AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Dijkstra Recommended to Watch: DijkstraScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Dijkstra's Algorithm Recommended to Watch: Dijkstra's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 16: Let's Code Dijkstra (1 March 2024)
Lecture 16: Let's Code Dijkstra (1 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Dijkstra Recommended to Watch: DijkstraScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Coding Practice 2 - Deadline: 19 March 2024
Coding Practice 2 - Deadline: 19 March 2024
Module Completed
Module In Progress
Module Locked
-
External UrlLink to the Problemset Link to the ProblemsetScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 4: C++ Standard Library (5 March 2024)
TA Session 4: C++ Standard Library (5 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: C++ Standard Template Library Recommended to Read: C++ Standard Template LibraryScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: The Hunt for the Missing Data Type Recommended to Read: The Hunt for the Missing Data TypeScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Homework 1 - Deadline: 20 March 2024
Homework 1 - Deadline: 20 March 2024
Module Completed
Module In Progress
Module Locked
Lecture 17: Disjoint Sets with Union (6 March 2024)
Lecture 17: Disjoint Sets with Union (6 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 19 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Union Find in 5 minutes! Recommended to Watch: Union Find in 5 minutes!Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Disjoint Sets with Examples Recommended to Watch: Disjoint Sets with ExamplesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Disjoint Sets in COMP 5711 Recommended to Watch: Disjoint Sets in COMP 5711Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: ITMO Academy - Disjoint Sets (Requires creating an account on codeforces and enrolling under EDU) Recommended Practice: ITMO Academy - Disjoint Sets (Requires creating an account on codeforces and enrolling under EDU)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 18: Graph Theory Background (6 March 2024)
Lecture 18: Graph Theory Background (6 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRecommended to Read: Chapters 1 and 2 of West's Introduction to Graph Theory (available at the HKUST library)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 19: Let's Code Strongly Connected Components (7 March 2024)
Lecture 19: Let's Code Strongly Connected Components (7 March 2024)
Module Completed
Module In Progress
Module Locked
-
Context Module Sub HeaderImportant: There was a mistake in Lecture 15. There is a correction at the beginning of this lecture.Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 20: Minimum Spanning Trees (7 March 2024)
Lecture 20: Minimum Spanning Trees (7 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 23 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Chapter 7 of Erickson Required Reading: Chapter 7 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Greedy Algorithms - Minimum Spanning Tree Recommended to Watch: Greedy Algorithms - Minimum Spanning TreeScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Dijkstra's Algorithm vs Prim's Algorithm Recommended to Watch: Dijkstra's Algorithm vs Prim's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: A Visualization of Prim's Algorithm Recommended to Watch: A Visualization of Prim's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Borůvka's Algorithm Recommended to Watch: Borůvka's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: A Visualization of Kruskal's Algorithm Recommended to Watch: A Visualization of Kruskal's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Borůvka's Algorithm Recommended to Read: Borůvka's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 21: Let's Code DFS Times, Topological Sort and Kosaraju's SCC Algorithm (7 March 2024)
Lecture 21: Let's Code DFS Times, Topological Sort and Kosaraju's SCC Algorithm (7 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: DFS-based Topological Sort Recommended to Watch: DFS-based Topological SortScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Kosaraju's Algorithm for Strongly Connected Components Recommended to Watch: Kosaraju's Algorithm for Strongly Connected ComponentsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 22: Dynamic Programming, Knapsack and Bellman-Ford (8 March 2023)
Lecture 22: Dynamic Programming, Knapsack and Bellman-Ford (8 March 2023)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading (really important): Chapter 8 of Erickson Required Reading (really important): Chapter 8 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 22 of CLRSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Dynamic Programming I Required Watching: Dynamic Programming IScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: A Visualization of the Bellman-Ford Algorithm Recommended to Watch: A Visualization of the Bellman-Ford AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Bellman-Ford Recommended to Watch: Bellman-FordScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: 0-1 Knapsack Recommended to Watch: 0-1 KnapsackScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderQuestion: What if there are infinitely many copies of each item in the Knapsack problem? In other words, what if we do not just choose whether to include an item or not, but also how many copies to take?Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Response to Your Feedback (8 March 2024)
Response to Your Feedback (8 March 2024)
Module Completed
Module In Progress
Module Locked
TA Session 5: Minimum Spanning Trees (12 March 2024)
TA Session 5: Minimum Spanning Trees (12 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: Inverse the Problem Recommended Practice: Inverse the ProblemScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 23: All-pairs Shortest Path, Johnson and Floyd-Warshall (13 March 2024)
Lecture 23: All-pairs Shortest Path, Johnson and Floyd-Warshall (13 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Chapter 9 of Erickson Required Reading: Chapter 9 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 23 of CLRS (All-pairs Shortest Paths)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Dynamic Programming - All-pairs Shortest Paths Recommended to Watch: Dynamic Programming - All-pairs Shortest PathsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Floyd-Warshall All-Pairs Shortest Paths Recommended to Watch: Floyd-Warshall All-Pairs Shortest PathsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: A Visualization of Floyd-Warshall Recommended to Watch: A Visualization of Floyd-WarshallScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Johnson's Algorithm Recommended to Watch: Johnson's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 24: Dynamic Programming on Strings (14 March 2024)
Lecture 24: Dynamic Programming on Strings (14 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Dynamic Programming II Required Watching: Dynamic Programming IIScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Chapter 3 of Erickson Recommended to Read: Chapter 3 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 25: Trees (14 March 2024)
Lecture 25: Trees (14 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRecommended to Read: Chapter 3 (Trees) of West's Introduction to Graph TheoryScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 26: Prefix Sums and Dynamic Programming on Trees (15 March 2024)
Lecture 26: Prefix Sums and Dynamic Programming on Trees (15 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Dynamic Programming IV Required Watching: Dynamic Programming IVScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired to Read: Slides on Dynamic Programming on Trees Required to Read: Slides on Dynamic Programming on TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: DP on Trees Tutorial Recommended to Read: DP on Trees TutorialScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Tree Diameter Recommended to Watch: Tree DiameterScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Diameter of a Tree Recommended to Read: Diameter of a TreeScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Practice Midterm Exam (18 March 2024)
Practice Midterm Exam (18 March 2024)
Module Completed
Module In Progress
Module Locked
-
Context Module Sub HeaderImportant: Use this practice exam to simulate a real exam. Print it out and work on it for 2.5 hours.Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 6: Dynamic Programming (19 March 2024)
TA Session 6: Dynamic Programming (19 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 27: Tree Diameter, Edit Distance and Set Cover (20 March 2024)
Lecture 27: Tree Diameter, Edit Distance and Set Cover (20 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Dynamic Programming III Required Watching: Dynamic Programming IIIScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Advanced Dynamic Programming Required Watching: Advanced Dynamic ProgrammingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Diameter of a Tree using DFS Recommended to Read: Diameter of a Tree using DFSScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 28: Dynamic Programming on Subsets (21 March 2024)
Lecture 28: Dynamic Programming on Subsets (21 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Advanced Dynamic Programming Recommended to Read: Advanced Dynamic ProgrammingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: Bitmask DP Recommended Practice: Bitmask DPScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 29: Lowest Common Ancestor and Segment Tree (22 March 2024)
Lecture 29: Lowest Common Ancestor and Segment Tree (22 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Binary Lifting Recommended to Watch: Binary LiftingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Lowest Common Ancestor Recommended to Watch: Lowest Common AncestorScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Midterm Exam (22 March 2024)
Midterm Exam (22 March 2024)
Module Completed
Module In Progress
Module Locked
TA Session 7: Let's Solve Coding Practice 1 (25 March 2024)
TA Session 7: Let's Solve Coding Practice 1 (25 March 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Coding Practice 3 - Deadline: 10 April 2024
Coding Practice 3 - Deadline: 10 April 2024
Module Completed
Module In Progress
Module Locked
-
External UrlLink to the Problemset Link to the ProblemsetScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 8: Dynamic Programming on Trees and Subsets (26 March 2023)
TA Session 8: Dynamic Programming on Trees and Subsets (26 March 2023)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlProblem 1 Problem 1Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlProblem 2 Problem 2Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlProblem 3 Problem 3Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 30: Segment Trees and Binary Indexed Trees (Fenwick Trees)
Lecture 30: Segment Trees and Binary Indexed Trees (Fenwick Trees)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Fenwick Tree (Binary Indexed Tree) Recommended to Watch: Fenwick Tree (Binary Indexed Tree)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Segment Tree Recommended to Read: Segment TreeScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Segment Tree Recommended to Watch: Segment TreeScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: ITMO Academy - Segment Tree I (Requires creating an account on codeforces and enrolling under EDU) Recommended Practice: ITMO Academy - Segment Tree I (Requires creating an account on codeforces and enrolling under EDU)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice: ITMO Academy - Segment Tree II (Requires creating an account on codeforces and enrolling under EDU) Recommended Practice: ITMO Academy - Segment Tree II (Requires creating an account on codeforces and enrolling under EDU)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Homework 2 - Deadline: 8 April 2024
Homework 2 - Deadline: 8 April 2024
Module Completed
Module In Progress
Module Locked
Homework 3 - Deadline: 19 April 2024
Homework 3 - Deadline: 19 April 2024
Module Completed
Module In Progress
Module Locked
Coding Practice 4 - Deadline: 28 April 2024
Coding Practice 4 - Deadline: 28 April 2024
Module Completed
Module In Progress
Module Locked
-
External UrlLink to the Problemset Link to the ProblemsetScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 31: Let's Code Prim, Kruskal and Borůvka's Algorithms for Minimum Spanning Tree (1 April 2024)
Lecture 31: Let's Code Prim, Kruskal and Borůvka's Algorithms for Minimum Spanning Tree (1 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 32: Let's Code Bellman-Ford and Floyd-Warshall (1 April 2024)
Lecture 32: Let's Code Bellman-Ford and Floyd-Warshall (1 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 9: Segment Trees (9 April 2024)
TA Session 9: Segment Trees (9 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 33: Amortized Analysis and Binomial Heaps (10 April 2024)
Lecture 33: Amortized Analysis and Binomial Heaps (10 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Amortized Analysis Required Watching: Amortized AnalysisScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 17 of CLRS (Amortized Analysis)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Sections 7.1 to 7.5 of these lecture notes by Damon Wischik Required Reading: Sections 7.1 to 7.5 of these lecture notes by Damon WischikScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Binary Heap, Binomial Heap, Fibonacci Heap (the latter is not part of the syllabus) Recommended to Watch: Binary Heap, Binomial Heap, Fibonacci Heap (the latter is not part of the syllabus)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Disjoint Sets and Kruskal's Algorithm Recommended to Watch: Disjoint Sets and Kruskal's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Fibonacci Heaps Recommended to Watch: Fibonacci HeapsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Fibonacci Heap Recommended to Watch: Fibonacci HeapScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Binomial Heap (This is in Hindi! but it has English subtitles) Recommended to Watch: Binomial Heap (This is in Hindi! but it has English subtitles)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 34: Ternary Search Trees and Tries (11 April 2024)
Lecture 34: Ternary Search Trees and Tries (11 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Tries Required Watching: TriesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Ternary Search Trees Recommended to Watch: Ternary Search TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: TST Find Recommended to Watch: TST FindScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: TST Insert and Remove Recommended to Watch: TST Insert and RemoveScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: TST Time Complexity Recommended to Watch: TST Time ComplexityScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlA tool to visualize Tries A tool to visualize TriesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlAnother tool to visualize Tries Another tool to visualize TriesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlSuggested Problem Suggested ProblemScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 35: Suffix Trees and Ukkonen's Algorithm (12 April 2024)
Lecture 35: Suffix Trees and Ukkonen's Algorithm (12 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Suffix Tries Required Watching: Suffix TriesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Suffix Tries' Size Required Watching: Suffix Tries' SizeScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Suffix Trees Required Watching: Suffix TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Queries on Suffix Trees Required Watching: Queries on Suffix TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Building Suffix Trees Required Watching: Building Suffix TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Suffix Links (blue edges in Ukkonen's algorithm) Required Watching: Suffix Links (blue edges in Ukkonen's algorithm)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: An Explanation of Ukkonen's Algorithm Required Reading: An Explanation of Ukkonen's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlA tool to visualize Compressed Tries A tool to visualize Compressed TriesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlA tool to visualize Ukkonen's Algorithm A tool to visualize Ukkonen's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Suffix Tree using Ukkonen's algorithm Recommended to Watch: Suffix Tree using Ukkonen's algorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Ukkonen's Algorithm on bananasnaX Recommended to Watch: Ukkonen's Algorithm on bananasnaXScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Fast String Searching With Suffix Trees Recommended to Read: Fast String Searching With Suffix TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: How to Implement Ukkonen's Algorithm in C Recommended to Read: How to Implement Ukkonen's Algorithm in CScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 10: Let's Solve Coding Practices 2 and 3 (16 April 2024)
TA Session 10: Let's Solve Coding Practices 2 and 3 (16 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 36: Pattern Matching using Rabin-Karp and Knuth-Morris-Pratt (17 April 2024)
Lecture 36: Pattern Matching using Rabin-Karp and Knuth-Morris-Pratt (17 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 32 of CLRS (String Matching)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Strings Required Watching: StringsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: String Matching Appendix to Erickson's Book Required Reading: String Matching Appendix to Erickson's BookScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Rolling Hash Functions Recommended to Watch: Rolling Hash FunctionsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: KMP Recommended to Watch: KMPScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: A visualization of KMP Recommended to Watch: A visualization of KMPScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: KMP Recommended to Watch: KMPScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: An example of KMP Recommended to Watch: An example of KMPScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Rabin-Karp Recommended to Watch: Rabin-KarpScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 37: Centroid Decomposition and Heavy-Light Decomposition (18 April 2024)
Lecture 37: Centroid Decomposition and Heavy-Light Decomposition (18 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Static Trees Required Watching: Static TreesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Centroid Decomposition Recommended to Watch: Centroid DecompositionScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Heavy-Light Decomposition Recommended to Watch: Heavy-Light DecompositionScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Centroid Decomposition Recommended to Watch: Centroid DecompositionScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice for Centroid Decompositions Recommended Practice for Centroid DecompositionsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended Practice for Heavy-Light Decompositions Recommended Practice for Heavy-Light DecompositionsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 38: Sparse Tables and Suffix Arrays (19 April 2024)
Lecture 38: Sparse Tables and Suffix Arrays (19 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Sparse Table Recommended to Watch: Sparse TableScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Suffix Arrays Recommended to Watch: Suffix ArraysScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Querying a Suffix Array Required Watching: Querying a Suffix ArrayScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Suffix Arrays Tutorial Required Watching: Suffix Arrays TutorialScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderYou should sign up on codeforces, go to EDU and sign up in the ITMO academy course for the link to work. Make sure you watch the videos of all 5 steps. I strongly recommend solving the problems, too.Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Building a Suffix Array Recommended to Watch: Building a Suffix ArrayScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Min LCP Skipping Required Watching: Min LCP SkippingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Maximum Skipping Required Watching: Maximum SkippingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: The Suffix Tree is in the Suffix Array Recommended to Watch: The Suffix Tree is in the Suffix ArrayScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Suffix Array Recommended to Watch: Suffix ArrayScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Another Tutorial on Suffix Array Recommended to Watch: Another Tutorial on Suffix ArrayScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Homework 4 - Deadline: 4 May 2024
Homework 4 - Deadline: 4 May 2024
Module Completed
Module In Progress
Module Locked
TA Session 11: Hints on Writing and Homeworks (13 April 2024)
TA Session 11: Hints on Writing and Homeworks (13 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 39: Maximum Flow and Ford-Fulkerson (24 April 2024)
Lecture 39: Maximum Flow and Ford-Fulkerson (24 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Max Flow and Min Cut Required Watching: Max Flow and Min CutScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Matching Required Watching: MatchingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Chapter 10 of Erickson Required Reading: Chapter 10 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 26 of CLRS (Maximum Flow)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: The Ford-Fulkerson Algorithm Recommended to Watch: The Ford-Fulkerson AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Residual Networks Recommended to Watch: Residual NetworksScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Augmenting Paths Recommended to Watch: Augmenting PathsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 40: Maximum Flow Algorithms of Ford-Fulkerson, Edmonds-Karp and Dinitz (25 April 2024)
Lecture 40: Maximum Flow Algorithms of Ford-Fulkerson, Edmonds-Karp and Dinitz (25 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Analysis of Edmonds-Karp Required Watching: Analysis of Edmonds-KarpScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Dinitz's Algorithm Required Watching: Dinitz's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Analysis of Dinitz's Algorithm Required Watching: Analysis of Dinitz's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Edmonds-Karp Recommended to Watch: Edmonds-KarpScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Dinitz's Algorithm Recommended to Watch: Dinitz's AlgorithmScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Network Flow and Matching Required Watching: Network Flow and MatchingScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 41: Combinatorial Games, Nim and the Sprague-Grundy Theorem (26 April 2024)
Lecture 41: Combinatorial Games, Nim and the Sprague-Grundy Theorem (26 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: Introduction to Combinatorial Game Theory (6 videos) Required Watching: Introduction to Combinatorial Game Theory (6 videos)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Sprague-Grundy Theorem Recommended to Watch: Sprague-Grundy TheoremScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Second Midterm Exam (29 April 2024)
Second Midterm Exam (29 April 2024)
Module Completed
Module In Progress
Module Locked
-
Context Module Sub HeaderThis exam was for students who had missed the midterm exam due to an acceptable reason.Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 12: Let's Solve Coding Practices 3 and 4 (30 April 2024)
TA Session 12: Let's Solve Coding Practices 3 and 4 (30 April 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 42: Halting and Finite Automata (2 May 2024)
Lecture 42: Halting and Finite Automata (2 May 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: DFA and NFA Required Reading: DFA and NFAScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Non-deterministic Finite Automata Required Reading: Non-deterministic Finite AutomataScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Turing and the Halting Problem Recommended to Watch: Turing and the Halting ProblemScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: DFA on Wikipedia Recommended to Read: DFA on WikipediaScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: NFA on Wikipedia Recommended to Read: NFA on WikipediaScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 43: Regular Languages and Turing Machines (3 May 2024)
Lecture 43: Regular Languages and Turing Machines (3 May 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: NFA to DFA Conversion Required Watching: NFA to DFA ConversionScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: NFA to DFA Conversion Example Recommended to Watch: NFA to DFA Conversion ExampleScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Turing Complete Recommended to Watch: Turing CompleteScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Slides on NFA Recommended to Read: Slides on NFAScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Turing Machines on Wikipedia Recommended to Read: Turing Machines on WikipediaScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
TA Session 13: Let's Solve Coding Practice 4 (7 May 2024)
TA Session 13: Let's Solve Coding Practice 4 (7 May 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderImportant Note: This TA session includes solutions to the coding practice. You may watch it to learn how to solve these problems. However, you are required to write your own code, i.e. the codes you submit on codeforces should be 100% authored by yourself. Note that all submissions go through plagiarism checks and the minimum penalty for copying code is a grade of F.Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 44: P, NP and Reductions (8 May 2024)
Lecture 44: P, NP and Reductions (8 May 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Complexity Zoo Recommended to Watch: Complexity ZooScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRequired Reading: Chapter 34 of CLRS (NP-completeness)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Watching: P, NP, NP-completeness Required Watching: P, NP, NP-completenessScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Cook-Levin Theorem (Proof that SAT is NP-complete) Recommended to Read: Cook-Levin Theorem (Proof that SAT is NP-complete)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Cook-Levin Theorem Recommended to Watch: Cook-Levin TheoremScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 45: NP-complete Problems (9 May 2024)
Lecture 45: NP-complete Problems (9 May 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRequired Reading: Chapter 12 of Erickson Required Reading: Chapter 12 of EricksonScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Karp's 21 NP-complete Problems Recommended to Read: Karp's 21 NP-complete ProblemsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlFun to See: List of NP-complete Problems Fun to See: List of NP-complete ProblemsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Savitch's Theorem (Proof that PSPACE=NPSPACE) Recommended to Read: Savitch's Theorem (Proof that PSPACE=NPSPACE)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Lecture 46 - NP-completeness of Knapsack and 3-colorability (10 May 2024)
Lecture 46 - NP-completeness of Knapsack and 3-colorability (10 May 2024)
Module Completed
Module In Progress
Module Locked
-
External UrlLecture Video Lecture VideoScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderThe following items are recommended to students who are interested to learn more about algorithms. They are not part of the syllabus of this course and will not appear in the final exam.Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Read: Parameterized Algorithms Recommended to Read: Parameterized AlgorithmsScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderRecommended to Read: Randomized Algorithms by Motwani and RaghavanScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: HKUST COMP 5711 (Advanced Algorithms) Lectures Recommended to Watch: HKUST COMP 5711 (Advanced Algorithms) LecturesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Advanced Algorithms (Harvard) Recommended to Watch: Advanced Algorithms (Harvard)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Advanced Data Structures (MIT) Recommended to Watch: Advanced Data Structures (MIT)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: Computational Complexity Lectures Recommended to Watch: Computational Complexity LecturesScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
External UrlRecommended to Watch: TCS Toolkit (CMU) Recommended to Watch: TCS Toolkit (CMU)Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
COMP 3711H Playlist on YouTube
COMP 3711H Playlist on YouTube
Module Completed
Module In Progress
Module Locked
-
External UrlYouTube Playlist YouTube PlaylistScore at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
-
Context Module Sub HeaderWe had a total of 60 lectures in this course. I am very grateful to every contributor, including Kerim Kochekov, Chun Kit Lam, Giovanna Kobus Conrado and Harshit Motwani. We all hope you enjoyed the course!Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete
Class Notes
Class Notes
Module Completed
Module In Progress
Module Locked
-
Context Module Sub HeaderIf you have taken and prepared high-quality notes during this class (such as the ones above), please send them to me by email so that I can publish them for everyone, including students in future offerings of this course. I am very thankful to the student(s) mentioned above for their excellent notes!Score at least Must score at least to complete this module item Scored at least Module item has been completed by scoring at least View Must view in order to complete this module item Viewed Module item has been viewed and is complete Mark done Must mark this module item done in order to complete Marked done Module item marked as done and is complete Contribute Must contribute to this module item to complete it Contributed Contributed to this module item and is complete Submit Must submit this module item to complete it Submitted Module item submitted and is complete