CPSC 5031 - Algorithms

3 credit hours
Basic strategies of algorithm design: top-down design, divide and conquer, average and worst-case complexity, asymptotic costs, simple recurrence relations. Applications to sorting and searching. Introduction to discrete optimization algorithm: dynamic programming, greedy algorithms.

Prerequisite Course(s): CPSC 5005