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

Other Resources

Course Curriculum

Course Reviews


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

No Reviews found for this course.


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

Learn More About us

About Us
Privacy Policy

top All rights reserved.

Setup Menus in Admin Panel