Analysis of Algorithms

3 units

This course introduces techniques for the mathematical analysis of algorithms, including randomized algorithms and non-worst-case analyses such as amortized and competitive analysis. It also introduces the standard paradigms of divide-and-conquer, greedy, and dynamic programming algorithms, as well as reductions, and it provides an introduction to the study of intractability and techniques to determine when good algorithms cannot be designed. *CSE 3407 has mandatory evening exams; the specific days and times will be listed under assessments on the course section once confirmed.