Introduction – Analysis of Algorithms, Insertion Sort, Merge sort – Asymptotic Notation | Recurrences | Substitution, Master Method – Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication- Quick sort, Randomized Algorithms- Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort – Order Statistics, Median-Hashing, Hash Functions-Universal Hashing, Perfect Hashing-Relation of BSTs to Quick sort | Analysis of Random BST – Red-black Trees, Rotations, Insertions, Deletions – Augmenting Data Structures, Dynamic Order Statistics, Interval Trees-Skip Lists – Amortized Algorithms, Table Doubling, Potential Method – Competitive Analysis: Self-organizing Lists-Dynamic Programming, Longest Common Subsequence – Greedy Algorithms, Minimum Spanning Trees – Shortest Paths I: Properties, Dijkstra,Bellman-Ford, Linear Programming, Difference Constraints,ll-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson-Advanced Topics

### Course Curriculum

 Introduction – Analysis of Algorithms, Insertion Sort, Mergesort Details 1:20:36 Asymptotic Notation | Recurrences | Substitution, Master Method Details 1:10:31 Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication Details 1:8:33 Quicksort, Randomized Algorithms Details 1:20:33 Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort Details 1:16:50 Order Statistics, Median Details 1:8:49 Hashing, Hash Functions Details 1:17:40 Universal Hashing, Perfect Hashing Details 1:19:47 Relation of BSTs to Quicksort | Analysis of Random BST Details 1:21:22 Red-black Trees, Rotations, Insertions, Deletions Details 1:23:52 Augmenting Data Structures, Dynamic Order Statistics, Interval Trees Details 1:23:45 Skip Lists Details 1:25:32 Amortized Algorithms, Table Doubling, Potential Method Details 1:19:6 Competitive Analysis: Self-organizing Lists Details 1:14:28 Dynamic Programming, Longest Common Subsequence Details 1:11:1 Greedy Algorithms, Minimum Spanning Trees Details 1:24:7 Shortest Paths I: Properties, Dijkstra Details 1:24:34 Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints Details 1:17:17 Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson Details 1:14:59 Advanced Topics Details 1:15:8 Advanced Topics (cont.) I Details 1:16:48 Advanced Topics (cont.) II Details 1:24:47 Advanced Topics (cont.) III Details 1:25:21

## N.A

ratings
• 5 stars0
• 4 stars0
• 3 stars0
• 2 stars0
• 1 stars0

No Reviews found for this course.

90 STUDENTS ENROLLED

FreeVideoLectures Provides you complete information about best courses online, Video tutorials, helps you in building a career !!

help@freevideolectures.com