Data Structures

Code: MA251 | L-T-P-C: 2-0-2-6

Prerequistes: CS101 or equivalent

Asymptotic notation, space and time complexity; Abstract data types, arrays, stacks, queues, linked lists, matrices, binary trees, tree traversals, heaps; Sorting - mergesort, quicksort, heapsort; Graph representations, breadth first search, depth first search; Hashing; Searching - linear search, binary search, binary search trees, AVL trees, red-black trees, B-trees.

Texts:

1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, Prentice-Hall of India, 2009.
2. E. Horowitz, S. Sahani and D. Mehta, Fundamentals of Data Structures in C++, University Press, 2008.

References:

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson Education, 2006.
2. A. M. Tannenbaum, Y. Langsam and M. J. Augenstein, Data Structures Using C++, Prentice-Hall of India, 1996.
3. M. A. Weiss, Data Structures and Problem Solving Using Java, Addison-Wesley, 1997.