Please enable JavaScript.
Coggle requires JavaScript to display documents.
Analysis of Algorithm (Dynamic Programming Approach (all pair shortest…
Analysis of Algorithm
Dynamic Programming Approach
all pair shortest path
single source shortest path
Assembly-line scheduling
0/1 knapsack
Multistage graphs
Travelling salesman problem
General Method
Longest common subsequence
Non-deterministic polynomial algorithms
NP Completeness and reducibility
NP Completeness proofs
Polynomial time verification
Vertex Cover Problems
Polynomial time
Clique Problems
Backtracking and Branch-and-bound
8 queen problem( N-queen problem)
Sum of subsets
General Method
Graph coloring
15 puzzle problem
Travelling salesman problem
Greedy Method Approach
Knapsack problem
Job sequencing with deadlines
Single source shortest path
Minimum cost spanning trees-Kruskal and prim‟s algorithm
General Method
Optimal storage on tapes
String Matching Algorithms
The naïve string matching Algorithms
The Rabin Karp algorithm
String matching with finite automata
The knuth-Morris-Pratt algorithm
Introduction to Analysis of Algorithm
Recurrences
Recursion tree method
Master method
The substitution method
Divide and Conquer Approach
General method
Analysis
Binary search
Merge sort
Quick sort
Strassen‟s matrix
multiplication