IT1004 DESIGN AND ANALYSIS OF ALGORITHMS
Instructor
Place Email id Syllabus Study Materials |
Selvamary. G
SRM University [email protected] Download PDF UNIT I-BASIC CONCEPTS OF ALGORITHMS Introduction - fundamentals of algorithm – algorithm design technique – designing an algorithm and data structure – methods of specifying an algorithm – analyzing algorithm – worst case, best case and average case analysis. UNIT II-MATHEMATICAL ASPECTS AND ANALYSIS OF ALGORITHMS Mathematical analysis - asymptotic notations – Big O, Big Theta, Big Omega – comparing orders of growth - non-recursive algorithm - mathematical analysis of recursive algorithm UNIT II Notes | Recursion tree examples 1 | Recursion Tree Examples 2 | Master Theorem Problems 1 | Master theorem problems 2 |Master Theorem | UNIT III-DIVIDE AND CONQUER Divide and conquer - Merge Sort – Quick sort – Binary search – Binary search tree traversal - Strassen’s matrix multiplication - Algorithms for the Closest-Pair and Convex-Hull Problems. Download Unit III Notes UNIT IV-GREEDY METHOD AND DYNAMIC PROGRAMMING Huffman Coding - Binomial Coefficients – Warshall's and Floyd's Algorithms Knapsack Problem and Memory Functions Download UNIT IV notes | Floyd Warshall Algorithm UNIT V-BACKTRACKING Backtracking - 8-Queen's Problem - Hamiltonian Circuit problem - Subset-Sum problem - Travelling salesman problem Download Unit V Notes |