CSC 440 Design & Analysis of Algorithm

Prerequisite: CSC 236 AND one of the following: MAT 105 or MAT 125 or higher-numbered MAT course

Offered: Typically alternate Spring Terms (next offered Spring 2014)

A study of algorithmic approaches to problem-solving, and techniques for designing, analyzing, and comparing algorithms. Approaches such as divide-and-conquer, dynamic programming, and backtracking will be studied. Topics in computational complexity include asymptotic complexity measures, intractability, and NP-complete problems. 1 Course Credit


1 Course Credit