Please enable JavaScript.
Coggle requires JavaScript to display documents.
Analysis of Algorithms (Module 1 (Introduction to analysis of algorithm…
Analysis of Algorithms
Module 6
Non-deterministic polynomial algorithms
NP Completeness proofs
NP
Completeness and reducibility
Vertex Cover Problems
Polynomial time verification
Polynomial time
Clique Problems
Module 4
Backtracking and Branch-and-Bound
General Method
8 queen problem( N-queen problem)
Sum of subsets
Graph coloring
15 puzzle problem
Travelling salesman problem
Module 1
Introduction to analysis of algorithm
Mathematical background
for algorithm analysis
Analysis of selection sort
Growth of function
Big -Oh Notation
Omega Notation
Theta Notation
space and time complexity
Analysis of insertion sort
Performance analysis
Divide and Conquer Approach
General method
Analysis of Merge sort
Analysis of Quick sort
Analysis of Binary search
Finding minimum and maximum algorithm and analysis,
Strassen's matrix
multiplication
Recurrences
The substitution method
Recursion tree method
Master method
Module 5
String
Matching Algorithms
String matching with finite automata
The Rabin Karp algorithm
The knuth-Morris-Pratt algorithm
The naïve string matching Algorithms
Module 3
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
Module 2
Dynamic Programming Approach
General Method
Multistage graphs
single source shortest path
all pair shortest path
Assembly-line scheduling
0/1 knapsack
Travelling salesman problem
Longest common subsequence