Please enable JavaScript.
Coggle requires JavaScript to display documents.
Analysis of Algorithm (Dynamic Programming Approach (general methid,…
Analysis of Algorithm
Dynamic Programming Approach
general methid
multistage graph
single source shortest path
all pair shortest path
assembly-line scheduling
0/1 knapsack
Travelling salesman problem
Longest common subsequence
Introduction to analysis of algorithm
Performance analysis
space complexity
time complexity
Growth of fuinction
Big-Oh
Omega
Theta notation
Mathematical background
selection sort
insertion sort
Recurrence
substitution
master
recursion tree
Divide and conquer approach
merge sort
quick sort
binary search
Non-deterministic polynomial algorithms
Polynomial time
Polynomial time verification
NP Completeness and reducibility
NP Completeness proofs
Vertex Cover Problems
Clique Problems
Backtracking and Branch-and-bound
General Method
8 queen problem( N-queen problem)
Sum of subsets
Graph coloring
15 puzzle problem
Travelling salesman problem
Greedy Method Approach
General Method
Single source shortest path
Knapsack problem
Job sequencing with deadlines
Minimum cost spanning trees-Kruskal and prim‟s algorithm
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