Abstraction – Abstract data types; Data Representation; Elementary data types; Basic concepts of data Structures; Mathematical preliminaries – big-Oh notation; efficiency of algorithms; notion of time and space complexity; performance measures for data structures.

ADT array – Computations on arrays – sorting and searching algorithms.

ADT Stack, Queue, list – array, linked list, cursor based implementations of linear structures. ADT Tree – tree representation, properties traversal of trees; ADT- Binary Trees – properties and algorithms, ADT Priority Queue – Heaps; heap-based implementations; applications of heaps – sorting; Search Tree – Binary search tree; balanced binary search trees – AVL tree; Applications of Search Trees – TRIE; 2-3-4 tree; concept of B-Tree. ADT Dictionary – array based and tree based implementations; hashing – definition and application .
Graphs: ADT- Data structure for graphs – Graph traversal- Transitive Closure- Directed Acyclic graphs – Weighted graphs – Shortest Paths – Minimum spanning tree – Greedy Methods for MST.

Text Book

1. Goodrich M T, Tamassia R and Michael H. Goldwasser, “Data Structures and  Algorithms in Python++”, Wiley publication, 2013. 

References

1. Goodrich M T and Tamassia R, “Data Structures and Algorithms in Java”, Fifth  edition, Wiley publication, 2010. 
2. Tremblay J P and Sorenson P G, “An Introduction to Data Structures with  Applications”, Second Edition, Tata McGraw-Hill, 2002. 
3. Clifford A. Shaffer, “Data Structures and Algorithm Analysis”, Third Edition,  Dover Publications, 2012.