Analysis of Algorithms

Catalog description

An advanced study of algorithms and data structures. Analysis of algorithms, space and time complexity, and the NP classes will be considered. Significant illustrative individual or group programming projects are required. Examples may be drawn from heuristic programming, encipherment, natural language processing, object code generation, combinatorial analysis, graphics, robotics, relational databases, or other algorithmic issues of current importance. Students with a semester level of Freshman 1, Freshman 2 or Sophomore 1 may not enroll.