CPSI 28003 - (was CPSC 2380) Algorithms

Three hours lecture. Three credit hours.

Was CPSC 2380. Concentrates on the design and analysis of algorithms. Topics include the correctness of algorithms, asymptotic notation, and time complexity of algorithms. Algorithm design techniques will be discussed such as divide and conquer, dynamic programming, network flow, and greedy algorithms. Algorithms based on these techniques and appropriate data structures will be studied for searching and sorting as well as graph theory and optimization problems.

Prerequisites: CPSI 27603 or equivalent and MATH 2310 or equivalent.