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 – applications of trees – binary search tree ADT – AVL Trees – - Heap – Applications of heap.

Definition – Representation of Graph – 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