Back
Video Tutorials
Slides
Links
Combinatorial Optimization
Analyze & Design Algorithms
Master's Theorem
Recursion Tree Method
Akra Bazzi Method
Correctness of Algorithms
Greedy Algorithms
Greedy Choice Property
Greedy V/S Dynamic
Fractional Knapsack Problem
Activity Selection Problem
Huffman Encoding
Task Scheduling Problem
Coin Changing Problem
Kruskal’s and Prim’s MST
Divide and Conquer Algorithms
Quick Sort Algorithms
Quick Sort Analysis
Merge Sort
Run Time Analysis
Intro to Dynamic Programming
Principle of Optimality
Optimal Substructure Property
Assembly Line Scheduling
Matrix Chain Multiplication
Matrix Chain Multiplication with DP
Traveling Salesperson Problem
BFS & DFS
Dijkstra Algorithm
Bellman Ford Algorithm
Floyd-Warshall Algorithm
Flow Networks
Convex Hull Algorithm
Linear Programs
LP : Standard Forms
LP : Simplex Method
Computational Geometry
KMP String Matching Algorithm
Rabin-Karp String Matching Algorithm
Simplex Algorithm and Integer Linear Programming
NP Completeness and NP Hard
NP-Hard Clique Decision Problem