Design and Analysis of Algorithms II

3 credits · Undergraduate

This course covers advanced techniques for the design and analysis of efficient algorithms. Problems are taken from a wide range of areas including combinatorics, numerical computation, graph algorithms, string matching, approximation algorithms, computational geometry, and NP-Completeness. PREREQUISITES: CSCI 3110.03 with a grade of C or better. EXCLUSIONS: MATH 4130.03