SYSTEM_INDEX
DIRECTORY / ALL_TOPICS
>
M1: Algorithm Analysis & Recurrences
-
Part A: High Frequency Definitions (Module 1 Focus)
-
Part B: Core Topics
-
Recursion Solving (Master’s & Recursion Tree)
-
Asymptotic Notations (Big O, Omega, Theta)
-
Algorithm Analysis (Linear/Binary/Insertion Sort)
>
M2: Advanced Data Structures & Graph Algorithms
-
Graph Traversals (BFS / DFS)
-
AVL Trees Construction
-
Disjoint Sets & Strongly Connected Components
-
Topological Sort
>
M3: Greedy Strategy & Divide and Conquer
-
Part A: High Frequency Definitions (Module 3 Focus)
-
Part B: Core Topics
-
Greedy: Fractional Knapsack
-
Greedy: Minimum Spanning Tree (Kruskal’s)
-
Greedy: Single Source Shortest Path (Dijkstra’s)
-
Divide and Conquer: Merge Sort
>
M4: Dynamic Programming, Backtracking and Branch & Bound
-
Dynamic Programming: Matrix Chain Multiplication
-
Dynamic Programming: Floyd-Warshall (All Pairs)
-
Backtracking / Branch & Bound: TSP and N-Queens
>
M5: Complexity Theory & Randomized Algorithms
-
Part A: High Frequency Definitions (Module 5 Focus)
-
Part B: Core Topics
-
Randomized Algorithms: Quick Sort
-
Approximation Algorithms: Bin Packing
-
NP Completeness Proofs (Clique)
-
NP Completeness Proofs (Vertex Cover)
[PREV]
[INDEX]
[NEXT]