Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list implementation – Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications of lists – Polynomial Manipulation-All Operations(Insertion,Deletion,Merge,Traversal)

Stack ADT – Operations – Applications – Evaluating arithmetic expressions- conversion of Infix to Postfix expression – Queue ADT – Operations – Circular Queue – Priority Queue – Applications of Queues.

Tree ADT – Tree Traversals – Binary Tree ADT – Expression trees –application of trees- Binary Search Tree ADT – AVL Trees – Heap-Applications of heap.

Graph Definition – Representation of Graphs – Types of Graph – Breadth-first traversal – Depth-first traversal –– Bi-connectivity – Cut vertex-Euler Circuits-Applications of graphs.

Searching – Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort – Shell sort .Hashing – Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing