Design and Analysis of Algorithms
END SEM EXAM on
Preparing for the exam? Check out the Master Solved Algorithms Guide (U1 to U7) for step-by-step solved numerical examples of every single algorithm across all units.
Unit - 1
BASICS OF ALGORITHMS AND MATHS, Learn fundamental algorithm analysis, asymptotic notations Big O, Omega, Theta, recurrence solving methods, and Master Theorem applications.
Unit - 2
DIVIDE & CONQUER ALGORITHMS, Master Divide and Conquer algorithmic paradigm, detailed analysis of Merge Sort, Quick Sort, Strassen Matrix Multiplication, and recurrences.
Unit - 3
GREEDY ALGORITHMS, optimal substructure, Fractional Knapsack, Activity Selection, Huffman Coding, and Minimum Spanning Tree algorithms.
Unit - 4
DYNAMIC PROGRAMMING paradigms, memoization, tabulation, 0/1 Knapsack problem, Longest Common Subsequence, and Matrix Chain Multiplication.
Unit - 5
EXPLORING GRAPH ALGORITHMS, Breadth-First Search (BFS), Depth-First Search (DFS), topological sorting, Dijkstra, and connected components.
Unit - 6
BACKTRACKING & BRANCH and BOUND strategies, solving the N-Queens problem, Subset Sum, Graph Coloring, and Travelling Salesperson.
Unit - 7
STRING MATCHING AND NP COMPLETENESS, Learn string matching algorithms like KMP and Rabin-Karp, computational complexity classes P versus NP, NP-Completeness, and Cook's Theorem.
Master Solved Algorithms
Comprehensive step-by-step solved numerical walkthroughs with visual graphs and diagrams for every algorithm in DAA Units 1 through 7.