CSE-402 DESIGN & ANALYSIS OF ALGORITHMS

Review of basic data structures. Concepts in algorithm analysis, Complexity measures, asymptotic notations, Domain independent techniques for algorithm design such as divide and conquer, dynamic programming. Greedy method, Back Tracking technique. Basic search and Traversal Technique. Algorithms for sets, graphs: Algorithms such as shortest path, Minimum spanning tree, depth first search and breadth first search etc. Transistive closure, Warshall’s algorithm. Internal and external sorting /searching/merging like Quick sort, Heap sort, Order statistics, Optimal binary search tree. Algebraic algorithms such as Matrix multiplications, Strason’s algorithm, LUP decomposition of matrices and applications.

TEXTBOOK

1. E. Horowitz & S.Sahani: Fundamentals of Computer Algorithms,Galgotia Publications Pvt. Ltd.

REFERENCES

1. A.V. Aho, J.E. Hoporaft and J.D. Ullman: Data Sturcture and algorithms, Addison-Weslay.

2. A.V. Aho, J.E. Hoporaft and J.D. Ullman - The design and analysis of Computer Algorithms, Addison-Weslay.

3. S.Basse: Computer Algorithm - Introduction to design and Analysis, Addison-Weslay.

4. E.M. Reingold, M.J. Nicvorgelt and N. Deo: Combinational Algorithms: Theory and Practice, Prentice Hall.

© Copyright National Institute of Science & Technology, Berhampur, Orissa, India
Website Maintained by NIST Training & Consultancy Services