Analysis and Design of Algorithm course is for B.E./ B. Tech students studying Analysis and Design of Algorithm in current semester
Concepts of algorithm, asymptotic complexity, examples of analysis use of recurrence relation in analysis of algorithms, removal of recursion, heap and heap sort, disjoint set structure.
Divide and conquer technique, analysis and design of algorithms base on this technique for binary search, merge sort, quick sort, selection problem matrix multiplication.
Study of greedy strategy, solutions based on greedy strategy for knap sack problem, minimum spanning trees, scheduling problem, shortest paths optimal merge patterns. Concept of dynamic programming and problems based on this approach such as O/I knapsack problem, multi-stage graphs, shortest paths, travelling sales person problem, reliability design problem.
Depth-first search, breadth search, bi-connected components. Backtracking concept and its example like 8-queen's problem, Hamiltonian cycle problem, introduction to branch and its examples like 8-puzzle problem travelling sales-person problem.
Binary search trees, height balanced trees, AVL trees, 2-3 trees, B-trees hashing. Introduction to lower-bound theory introduction to NP-Complete and NP Hard problems, examples of NP complete problem like Hamiltonian path and circuits, Eulerian paths and circuits etc.
B.E./ B. Tech students studying Analysis and Design of Algorithm in current semester