Semester Offered: Second Semester Credits (Range): 3 hours Attribute:3NS, QP-F
Students will be introduced to algorithm design and analysis, with an emphasis on applications to real-life problems arising in computing applications. Students will study the basic design techniques of the field from a theoretical perspective and learn how to apply these techniques to solve problems in simple, efficient ways. Computational complexity focusing on NP-completeness, and algorithmic techniques for intractable problems are also covered. Knowledge of discrete mathematics is necessary. Enrollment Limit: 48. Instructor: A. Sharp Prerequisites & Notes Note: Prerequisite: CSCI 275. Co-requisite: MATH 220.
