Please enable JavaScript.
Coggle requires JavaScript to display documents.
ANALYSIS OF ALGORITHM (2.DYNAMIC PROGRAMMING APPROACH (SINGLE SOURCE…
ANALYSIS OF ALGORITHM
2.DYNAMIC PROGRAMMING APPROACH
SINGLE SOURCE SHORTEST PATH
ALL PAIR SHORTEST PATH
MULTISTAGE GRAPHS
ASSEMBLY LINE SCHEDULING
TRAVELLING SALESMAN PROBLEM
LONGEST COMMON SUBSEQUENCE
3.GREEDY METHOD APPROACH
SINGLE SOURCE SHORTEST PATH
KNAPSACK PROBLEM
GENERAL METHOD
OPTIMAL STORAGE
JOB SEQUENCING
MINIMUM COST SPANNING TREES
4.BACKTRACKING AND BRANCH AND BOUND
8 QUEEN PROBLEM
SUM OF SUBSETS
GENERAL METHOD
GRAPH COLORING
TRAVELLING SALESMAN PROBLEM
15 PUZZLE PROBLEM
6.NON-DETERMINISTIC POLYNOMIAL ALGORITHMS
NP COMPLETENESS PROOFS
VERTEX COVER PROBLEMS
NP COMPLETENESS AND REDUCIBILITY
POLYNOMIAL TIME VERIFICATION
CLIQUE PROBLEMS
POLYNOMIAL TIME
1INTRODUCTION
GROWTH OF FUNCTION
BIG-OH
OMEGA
THETA NOTATION
SORT
SELECTION AND INSERTION
PERFOMANCE ANALYSIS
SPACE AND TIME COMPLEXITY
RECURRENCES
SUBSTITUTION METHOD
RECURSION TREE AND MASTER METHOD
DIVIDE AND CONQUER
GENERAL METHOD
MERGE,QUICK,ANALYSIS
5.STRING MATCHING ALGORITHM
THE RABIN KARP ALGORITHM
STRING MATCHING WITH FINITE AUTOMATA
THE NAIVE STRING MATCHING ALGORITHMS
THE KNUTH-MORRIS-PRATT ALGORITHM