DATA STRUCTURES AND ALGORITHMS

Code: MA793 | L-T-P-C: 3-0-2-8

MA793 DATA STRUCTURES AND ALGORITHMS L-T-P-C [3-0-2-8] Pre requisites: Nil

Review of linear and non-linear data structures, dynamic storage allocation techniques; Advanced data structures - B-Trees, Binomial and Fibonacci, set representation and operations; Algorithm analysis - time and space complexities; Sorting and searching algorithms; Algorithm design techniques: divide and conquer, dynalii;c programming, search and traversals, backtracking, branch and bound; Review of graph algorithms; Flow networks, sorting networks, arithmetic circuits, matrix operations, polynomials and FFT, number theoretic algorithms, string matching.

Texts:

1. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, Prentice Hall of India Private Limited, 2002.
2. D. C. Kozen, The Design and Analysis of Algorithms, Springer Verlag, 1992.
3. A. V. Aho, J. E. Hoperoft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.