Abstract Data Types (ADTs) –Introduction to analysis of algorithms – asymptotic notations – Non recursion & recursion – analyzing recursive algorithms- List ADT – array-based implementations – linked list implementations – singly linked lists – circularly linked lists – doubly linked lists Exercise: 1. Implement List ADT 2. Linked list implementations of List

Stack ADT – Applications of Stack: Infix to Postfix conversion-Postfix Evaluation- Balanced parentheses -Function Call. Queue ADT – Circular Queue- double ended queues – applications Queue Exercise: 3.ImplementationofStackandQueueADTs 4.Applications of Stack and Queue ADTs

Bubble sort – selection sort – insertion sort – divide & conquer- merge sort – quick sort – analysis of sorting algorithms – linear search – binary search – hashing – hash functions – collision handling – load factors, rehashing, and efficiency Exercise: 5.Implementationofsortingandsearchingalgorithms 6.ImplementationofHashtables

Tree ADT – Binary Tree ADT – tree traversals – Back Tracking - binary search trees – AVL trees – heaps – multi- way search trees- Branch & Bound: Knapsack Problem Exercise: 7. Tree representation and traversal algorithms 8. Implementation of Binary Search Trees 9. Implementation of Heaps

Graph ADT – representations of graph – graph traversals – DAG – topological ordering –dynamic programming: shortest paths – greedy algorithms: minimum spanning trees – Limitations of Algorithm Power-P, NP and NP-Complete Problems Exercise: 10. Graph representation and Traversal algorithms 11. Implementation of single source shortest path algorithm 12. Implementation of minimum spanning tree algorithms