A comprehensive mini-book covering all topics from Subject Code 2343112. Learn with detailed explanations, visual diagrams, and exam-focused examples.
Time & Space Complexity β’ Asymptotic Notations (O, Ξ©, Ξ) β’ Recurrence Relations β’ Substitution Method β’ Recursion Tree β’ Master Theorem
AVL Trees β’ B-Trees & B+ Trees β’ Red-Black Trees β’ Tries β’ Graphs β’ BFS & DFS Traversals
Greedy Properties β’ Fractional Knapsack β’ Prim's Algorithm β’ Kruskal's Algorithm β’ Job Sequencing β’ Optimal Storage
N-Queens Problem β’ Sum of Subsets β’ Graph Coloring β’ Hamiltonian Cycles β’ Ford-Fulkerson β’ Flow Networks
DP vs Greedy β’ Dijkstra's Algorithm β’ Bellman-Ford β’ Floyd-Warshall β’ 0/1 Knapsack β’ Travelling Salesman
NaΓ―ve String Matching β’ Rabin-Karp β’ KMP Algorithm β’ LCS Algorithm β’ Text Search β’ DNA Sequencing Applications
Start with Module 1 to build a strong foundation, or jump directly to the module you need to study.
Start Learning β