Introduction to Data Structures: Data Structures and its Types, Algorithms, Time Complexity, Recurrence, Probabilistic Analysis, Amortized Analysis, Competitive Analysis. [CO1]
Sorting Algorithms: Quick Sort, Heap Sort, Counting Sort, Bucket Sort, Multi-way Merge Sort. [CO1]
Hashing Techniques: Direct Address Tables, Hash Tables, Hash Functions, Open Addressing, Perfect Hashing. [CO2]
Advanced Data Structures: AVL Trees, Red-Black Trees, Splay Trees, B-trees, Binomial Heaps, Fibonacci heaps, Data Structures for Disjoint Sets.
Graphs & Algorithms: Graphs Representation, Minimum Spanning Tree (MST), Single Source Shortest Paths, All Pairs Shortest Paths, Maximum Flow. [CO3]
String Matching: String, String Length, String Concatenation, String Copy, String-Matching, Brute Force algorithm, Rabin Karp algorithm, Knuth-Morris-Pratt (KMP) algorithm, Boyer–Moore algorithm.