Please enable JavaScript.
Coggle requires JavaScript to display documents.
Analysis Of Algorithms (Module 1 (Introduction to AOA (Performance…
Analysis Of Algorithms
Module 1
Recurrences
Recursion tree method
Master method
The substitution method
Divide And Conquer Approach
Analysis of merge sort, quick sort,binary search
Minimum and Maximum Algorithm and analysis
Strassen's matrix multiplication
Introduction to AOA
Performance Analysis
Space and Time Complexity
Growth of function
Mathematical background for analysis
Analysis of selection sort, insertion sort
Module 3
Greedy Method Approach
General Method
Single source shortest path
knapsack problem
Job sequencing with deadlines
Kruskal and Prim's Algorithm
Optimum storage on tapes
Module 4
Backtracking Branch and Bound
General Method
N-queen problem
Sum of subsets
Graph coloring
15 puzzle problem
Travelling salesman problem
Module 2
Dynamic Memory 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
Module 5
String Matching Algorithms
The naive string matching algorithm
Rabin Carp algorithm
String matching with finite automata
Knuth-Morris Algorithm
Module 6
Non-deterministic Polynomial Algorithm
Polynomial time
Polynomial time verification
NP completeness and reducibility
NP completeness proofs
Vertex cover problems
Clique problems