Module 1
RAM Model
Some Sorting Algorithms
Searching
Probabilistic Algorithms
KMP (Knuth Morris Prat Algorithm)
Heap Sort
Quick Sort
Hashing
Some Sorting Algorithms
Searching
Probabilistic Algorithms
KMP (Knuth Morris Prat Algorithm)
Heap Sort
Quick Sort
Hashing
Module 2
Strassen's Matrix Multiplication
Floyd - Warshall Algorithm
CYK Algorithm
Backtracking and Branch and Bound
Greedy vs Dyanamic Programming
Knapsack problem
Huffman Coding
Minimum Spanning Tree - Prim's and Kruskal's
Optimal Binary Search Tree
Optimal Polygon Triangulation
Matroids and Theoretical foundations of Greedy
Floyd - Warshall Algorithm
CYK Algorithm
Backtracking and Branch and Bound
Greedy vs Dyanamic Programming
Knapsack problem
Huffman Coding
Minimum Spanning Tree - Prim's and Kruskal's
Optimal Binary Search Tree
Optimal Polygon Triangulation
Matroids and Theoretical foundations of Greedy
Module 3
NP Completeness
Integer Programming
Approximation Algorithms
Bin Packing
Graph Coloring - Refer lecture notes
Integer Programming
Approximation Algorithms
Bin Packing
Graph Coloring - Refer lecture notes
Module 4
Probabilistic Algorithms - PRNG Methods
Monte Carlo Algorithms
Verifying Matrix Multiplication
Primality Testing
Miller Rabin Primality Testing
Las Vegas Algorithm
Amplification of Stochastic Advantage
Applications to Cryptography - Interactive Proof System
Pollard's Rho heuristic for integer Factorization
Dixon's Integer Factorization
Probabilistic Counting, 8 Queen Solution etc
Monte Carlo Algorithms
Verifying Matrix Multiplication
Primality Testing
Miller Rabin Primality Testing
Las Vegas Algorithm
Amplification of Stochastic Advantage
Applications to Cryptography - Interactive Proof System
Pollard's Rho heuristic for integer Factorization
Dixon's Integer Factorization
Probabilistic Counting, 8 Queen Solution etc
Acknowledgement: These presentations i have collected from different sources(some authors are even unknown to me). The original authors are acknowledged for their contributtion