Please enable JavaScript.
Coggle requires JavaScript to display documents.
ANAYLSIS OF ALGORITHM (DYNAMIC PROGRAMMING APPROACH (Assembly- line…
ANAYLSIS OF ALGORITHM
INTRODUCTION TO ANALYSIS OF ALGORITHM
Performance analysis
Growth of function
Omega
Theta notation
Big -Oh
Space and Time Complexity
Mathematical background for algorithm analysis
Analysis
Insertion sort
Selection sort
RECURRENCES
Recursion tree method
Master method
The Substitution method
DIVIDE AND CONQUER APPROACH
General method
Analysis
Quick sort
Binary search
Merge sort
Strassen's matrix multplication
Finding min and max algorithm and analysis
DYNAMIC PROGRAMMING APPROACH
Assembly- line scheduling
0/1 knapsack
All pairs shortest path
Single source shortest path
Travelling salesman problem
Multistage Graphs
Longest common subsequence
General method
GREEDY METHOD APPROACH
Single source shortest path
Knapsack problem
General method
Job sequencing with deadlines
Minimum cost Spanning trees -Kruskal and prims's algorithm
Optimal storage on tapes
BACKTRACKING AND BRANCH-AND-BOUND
Graph coloring
Sum of Subsets
8 queen problem(N- queen problem)
General method
15 puzzle problem
Travelling salesman problem
STRING MATCHING ALGORITHM
The Rabin Karp
String matching with finite automata
The naive string matching
The knuth-Morris-Pratt
NON-DETEMINISTIC POLYNOMIAL ALGORITHM
Np completeness proofs
Vertex Cover Problems
NP completeness and reducibility
Clique Problems
Polynomial time and its verification