ANALYSIS & DESIGN OF ALGORITHM

Algorithms, Designing algorithms, Analyzing algorithms, Asymptotic notations, Heap and heap sort. Introduction to divide and conquer technique, Analysis, Design and comparison of various algorithms based on this technique, Example binary search, Merge sort, Quick sort, Strassen's matrix multiplication. Study of greedy strategy, Examples of greedy method like optimal merge patterns, Huffman coding, Minimum spanning tress, Knapsack problem, Job sequencing with deadlines, Single source shortest path algorithm, etc. Concept of dynamic programming, Problems based on this approach such as 0/1 knapsack, Multistage graph, Reliability design, Floyd-warshall algorithm, etc. Backtracking concept and its examples like 8 queen's problem, Hamiltonian cycle, Graph coloring problem etc. Introduction to branch and bound method, Examples of branch and bound method like traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem, Introduction to parallel algorithms. Binary search tress, Height balanced trees, 2-3 trees, B-tress, Basic search and traversal techniques for trees and graphs (Inorder, Preorder, Postorder, DFS, BFS), NP-completeness.