Analysis of Algorithms

Catalog description

This course introduces the student to tools and techniques necessary in the analysis of algorithms. The course includes a systematic study of algorithms and their complexity with application to searching and sorting, pattern matching, geometric and graph algorithms, NP-complete, and intractable problems. The student will study mathematical concepts including: summations, recurrence relations, introductory number theory, binomial coefficients, and generating functions.