Search Results

MATH 8080  DESIGN AND ANALYSIS OF ALGORITHMS (3 credits)

The course provides students an understanding of advanced topics in algorithms. Main topics include: growth of functions, asymptotic notation, recurrences, divide and conquer, dynamic programming, greedy algorithms, graph algorithms, and the theory of NP-Completeness. (Cross-listed with CSCI 8080).

Prerequisite(s)/Corequisite(s): CSCI 3320 or CSCI 8325 or equivalent. Not open to non-degree graduate students.