CPSC 3200

A study of problem solving techniques including divide and conquer, dynamic programming, greedy algorithms, search and backtracking, heuristics for hard problems. The techniques will be applied for programming solutions to small but challenging problems from a variety of areas, including arithmetic and algebra, number theory, graph theory, combinatorics, geometry, strings. Prerequisite(s): Computer Science 3620 AND Application to the Department of Mathematics and Computer Science Note: The course is intended for students who enjoy solving programming contest problems and will serve as preparation for the ACM International Collegiate Programming Contest.