Data Structures with Object Oriented Programming

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

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.

Classes and objects, Inheritance, polymorphism, Exceptions handling.

Texts:

• T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, Prentice-Hall of India, 2009.
• E. Horowitz, S. Sahani and D. Mehta, Fundamentals of Data Structures in C++, University Press, 2008.
• Herbert Schildt, Java - The Complete Reference, Ninth Edition, McGraw Hill Education, 2017.

 

References:

• A. V. Aho, J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson Education, 2006.
• A. M. Tannenbaum, Y. Langsam and M. J. Augenstein, Data Structures Using C++, Prentice-Hall of India, 1996
• M. A. Weiss, Data Structures and Problem Solving Using Java, Addison-Wesley, 1997.
• Robert Lafore, Object Oriented Programming in C++, Fourth Edition, Sams, 2001.