Data Structures & Algorithms syllabus

Introduction to Data Structures: Data, Data Object, Data types, Abstract Data Types (ADT), Data structures, Classification of Data Structure: primitive and non-primitive, Static and Dynamic, Persistent and Ephemeral data structures Introduction to Algorithms: Definition and Characteristics of an algorithm, Algorithm Specification, Introduction to algorithm design strategies Performance Analysis- Time and space complexity, Asymptotic notations, Best, Average and worst cases. Finding complexity using step count method, Analysis of programming Constructs-Linear, Quadratic, Cubic, Logarithmic Basic Searching Algorithms: Linear Search, Binary Search Basic Sorting Algorithm: Bubble Sort, Selection Sort, Insertion Sort

Linked Lists: Singly LL, Doubly LL, Circular LL. Linked list as an ADT. Stack: Stack as an ADT, Arrays and Linked Lists implementation, Implicit vs explicit stack, Applications of stack: recursion, converting expressions from infix to postfix or prefix form, evaluating postfix or prefix form Queue: Queue as an ADT, Arrays and Linked Lists implementation, Types: Circular Queue, Double- ended Queue (Deque), Applications

Tree-Definitions and Concepts, Representation of binary tree, Binary tree traversal (Inorder, postorder, preorder), Threaded binary tree, Binary search trees, Conversion of General Trees To Binary Trees, Applications Of Trees Some balanced tree mechanism, eg. AVL trees, 2-3 trees, Height Balanced, Weight Balance, Graph-Matrix Representation Of Graphs, Elementary Graph operations,(Breadth First Search, Depth First Search, Spanning Trees, Shortest path, Minimal spanning tree- Prims and Kruskals Algorithm ) Heap: Heap data structure, Min and Max Heap, Heap sort, applications of heap

Hashing: Hash Functions, Collision Handling Techniques (Chaining, Open Addressing) String Processing: Naïve String Matching, Rabin-Karp Algorithm, Knuth-Morris-Pratt (KMP) Algorithm Applications of DSA: , Social Network Graph Analysis, and AI Search Algorithms

Divide and Conquer: Merge Sort, Quick Sort, Matrix Multiplication; Greedy Algorithms: Activity Selection, Fractional Knapsack, Huffman Coding; Dynamic Programming: 0/1 Knapsack, Longest Common Subsequence (LCS), Floyd-Warshall.