Introduction-Types-Linked Lists- Stack ADT – Queue ADT – Circular queue implementation – Applications of stack and queue- Tree ADT – Tree traversals– Binary Tree ADT – Expression trees
Binary search tree ADT – AVL trees – Binary heaps – B trees-B+ trees –- Applications of trees-Huffman Tree
Definitions – Topological sort – Breadth-first traversal – Shortest path algorithms –Minimum spanning tree – Prim's and Kruskal's algorithms – Depth first traversal –biconnectivity – Euler circuits – Applications of graphs: Travelling salesman Problem
Hashing – Separate chaining – Open addressing – Rehashing – Extendible hashing –Disjoint Set ADT – Dynamic equivalence problem – Smart union algorithms – Path compression
Introduction to Algorithm analysis: Asymptotic notation-Sorting:Bubble sort- Selection sort- Insertion sort- Shell sort- Heap sort- Quick sort- Merge sort – Searching: Linear search- Binary search.
Reference Book:
1 A. V. Aho, J. E. Hopcroft and J. D. Ullman, “Data Structures and Algorithms”, Pearson Education, 2nd Edition, 2007 2 A.M.Tenenbaum, Y. Langsam and M. J. Augenstein, “Data Structures using C”, Pearson Education, 1st Edition, 2003 3 Reema Thareja, “Data Structures Using C” Oxford Second Edition, 2014 4 Sahni Horowitz, “Fundamentals of Data Structures in C” ,Universities Press; Second edition 2008 5 Noel Kalicharan, “Datastructures in C”, Create Space Independent Publishing Platform; 1st edition 2008
Text Book:
1 M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Pearson Education, 8th Edition, 2007