MSCS 504L - Algorithm Analysis & Design

4 Credits

This course continues the study of data abstraction and algorithm complexity from a more
mathematically formal viewpoint. Time complexity of algorithms will be examined using Big O
notation and worst-, best-, and average-case analyses. The ideas of polynomial-time, NP,
exponential, and intractable algorithms will be introduced. Elementary-recurrence relation
problems relating to recursive procedures will be solved. Sorting algorithms will be formally
analyzed. Strategies of algorithm design such as backtracking, divide and conquer, dynamic
programming, and greedy techniques will be emphasized.

Corequisite(s): MATH 205L, MSCS 501L