Course Description

This course introduces algorithm design strategies and their applications in solving common computational problems. Key topics include analyzing the asymptotic behavior of algorithms and exploring core design paradigms such as brute force, exhaustive search, divide-and-conquer, dynamic programming, greedy techniques, backtracking, and branch-and-bound approaches. The course also covers intractability, including NP-complete problems, and introduces parallel and distributed computing concepts to address computational efficiency in complex problem-solving.