Credit Weight: 0.5 Prerequisite(s): Computer Science 2412 and Mathematics 1271, 1272 Description: Design of algorithms and analysis of required time and space resources for execution. Lower bounds for resource requirements. Problems in arithmetic, order statistics, set manipulation, string matching, graph theory. Polynomial time, P, and non-deterministic polynomial time, NP, computable algorithms. NP complete problems. Offering: 0-0; 3-0
Credit Weight: 0.5 Prerequisite(s): Computer Science 2412 and Mathematics 1271, 1272 Description: Design of algorithms and analysis of required time and space resources for execution. Lower bounds for resource requirements. Problems in arithmetic, order statistics, set manipulation, string matching, graph theory. Polynomial time, P, and non-deterministic polynomial time, NP, computable algorithms. NP complete problems. Offering: 0-0; 3-0