2025-26 ODD Sem ADA

The course on Algorithms introduces students to the fundamental principles of problem-solving and efficient computation. It covers the design and analysis of algorithms, including asymptotic complexity, sorting and searching techniques, graph algorithms, and advanced paradigms such as divide and conquer, greedy methods, dynamic programming, and backtracking. The course also explores hashing, string matching, and concepts of NP-completeness, emphasizing both theoretical understanding and practical applications. By the end of the course, students gain the ability to analyze problems, design optimized solutions, and apply algorithms effectively in real-world scenarios.