CSCI 420 Algorithm Analysis and Theory

Basic techniques for designing and analyzing algorithms, and an introduction to the theory of computation. Topics include methods for showing upper and lower bounds on time and space costs, sorting, searching, dynamic programming, divide-and-conquer, greedy methods, NP-Completeness, reduction proofs, and an introduction to algorithms. Pre-requisite: CSCI 342 - Object programming with Data Structures. Spring. Odd years.

Credits

4