Design, implementation and presentation of algorithms and data structures emphasizing dynamic programming and both exact and heuristic approaches to NP-hard problems; problem solving sessions, programming projects and presentations. Course Information: 3 undergraduate hours. 4 graduate hours. Prerequisite(s): CS 401; and consent of the instructor.