Algorithms and Complexity

Catalog description

Introduces formal techniques to support the design and analysis of algorithms, focusing on both the underlying mathematical theory and practical considerations of efficiency. Topics include asymptotic complexity bounds, techniques of analysis, and algorithmic strategies. The following will be done with numerous algorithms used in modern computing solutions: Research the algorithm using AI tools to complement required reading and classroom activities; Explain the details of the algorithm methodology and performance; Implement the algorithm in an imperative programming language.