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.
inary 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 sortInsertion sort- Shell sort- Heap sort- Quick sort- Merge sort – Searching: Linear search- Binary search
Reference Book:
M. A. Weiss, “Data Structures and Algorithm Analysis in Câ€, Pearson Education, 8th Edition, 2007. [Unit I, II, III, IV,V]
Text Book:
1. V. Aho, J. E. Hopcroft and J. D. Ullman, “Data Structures and Algorithmsâ€, Pearson Education, 2nd Edition, 2007 [Unit IV]. 2 A.M.Tenenbaum, Y. Langsam and M. J. Augenstein, “Data Structures using Câ€,PearsonEducation, 1st Edition, 2003.(UNIT I,II,V) 3 ReemaThareja, “Data Structures Using C†Oxford Second Edition,2014.(UNIT I,II,III,V)
