CSC 312 Algorithm Design and Analysis

A study of algorithms and their complexity, including sorting, searching, pattern matching, combinatorics, backtracking, dynamic programming, and approximations and heuristics for NP-complete problems. (3 credit hours)