Please enable JavaScript.
Coggle requires JavaScript to display documents.
ALGORITHMS - Coggle Diagram
ALGORITHMS
Algorithm Analysis
Time Complexity
Space Complexity
Asymptotic Notations (O, Ω, Θ)
Best / Worst / Average Case
Recurrence Relations
Substitution Method
Searching
Linear Search
Binary Search
Interpolation Search
Pattern Searching
Naïve String Matching
Rabin–Karp Algorithm
Knuth–Morris–Pratt (KMP)
UNIT II: GRAPH ALGORITHMS
Graph Representation
Adjacency Matrix
Adjacency List
Graph Traversal
DFS
BFS
Applications
Connectivity
Strong Connectivity
Bi-connectivity
Minimum Spanning Tree
Kruskal’s Algorithm
Prim’s Algorithm
Shortest Path
Bellman–Ford
Dijkstra’s Algorithm
Floyd–Warshall
Network Flow
Flow Networks
Ford–Fulkerson Method
Matching
Maximum Bipartite Matching
UNIT V: NP-COMPLETE & APPROXIMATION ALGORITHMS
Tractable vs Intractable Problems
Polynomial Time Algorithms
Venn Diagram (P, NP)
NP Theory
NP Algorithms
NP-Hard
NP-Complete
Problem Reduction
Bin Packing
TSP
3-CNF
Approximation Algorithms
TSP
Randomized Algorithms
Concept & Applications
Primality Testing
Randomized Quick Sort
Kth Smallest Element
UNIT III: ALGORITHM DESIGN TECHNIQUES
Divide and Conquer
Max–Min Problem
Merge Sort
Quick Sort
Dynamic Programming
Principles of DP
Matrix Chain Multiplication
Multistage Graph
Optimal Binary Search Tree
Greedy Technique
Greedy Strategy Elements
Activity Selection
Optimal Merge Pattern
Huffman Coding
UNIT IV: STATE SPACE SEARCH ALGORITHMS
Backtracking
N-Queens Problem
Hamiltonian Circuit
Subset Sum
Graph Coloring
Branch and Bound
15-Puzzle Problem
Assignment Problem
Knapsack Problem
Travelling Salesman Problem