Analysis of Algorithms

Undergraduate

Brief review of computer representation and manipulation of mathematical structures. Introduction to models of computations, basic programming techniques for efficiency (recursion, balancing back-tracking, etc.), complexity theory, estimation and measurement of efficiency of algorithms, and proving algorithms optimal. Prerequisite(s): COMP 2113, MATH 1023, MATH 1413 or MATH 1313, MATH 1323 or MATH 1333, each with a minimum grade of C-.