CPSC 2380 - Algorithms

Three hours lecture. Three credit hours.

This course concentrates on the design and analysis of algorithms. Topics include 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: CPSC 2376 or equivalent and MATH 2310 or equivalent.