Catalog description
Problem solving strategies including: divide and conquer, greedy, backtracking,and dynamic programming;
complexity analysis of algorithms; introduction to complexity classes P and NP, with strategies for NP-complete problems.
Prerequisite: CSC 354.
Syllabus and detailed description for Spring 2003