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

Hashing – Separate chaining – Open addressing – Rehashing – Extendible hashing –Disjoint Set ADT – Dynamic equivalence problem – Smart union algorithms – Path compression – Applications of Sets

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.