Description:
This course presents the major principles of algorithm design and analysis, and applies those principles to classical problems in computer science. Topics include complexity, advanced ADTs, searching and sorting, graph search and traversal, dynamic programming, cryptography, theoretical computer science, operations on polynomials and matrices, and pattern matching. As a capstone experience, students participate in a mini-colloquium covering the course topics.

Option for major/minor:
Computer Science Minor