Asymptotic notation. Introduction to Algorithm Analysis Methodologies Review of Data Structures: Linear Data Structures – Linked Lists: - Singly LL, Doubly LL,Circular LL. Implementation–Applications. Stacks:-Implementation using Arrays and Linked Lists –Applications in Recursion. Queues -Implementation and Applications. Binary Trees - Basic tree traversals - Binary tree -Priority queues -Binary search tree. AVL trees.
Graphs -Data Structures for Graphs, Types of Graphs: Directed Graphs, Weighted Graphs, etc.. Basic definitions and properties of Graphs, Graph Traversal –Breadth First Search and their applications, Spanning trees, Shortest Paths. Hashtables – Collision using Chaining – Linear Probing – Quadratic Probing – Double Hashing.