Computer Science and Engineering
CSE 102 Introduction to Analysis of Algorithms
Methods for the systematic construction and mathematical analysis of algorithms. Order notation, the RAM model of computation, lower bounds, and recurrence relations are covered. The algorithm design techniques include divide-and-conquer, branch and bound, and dynamic programming. Applications to combinatorial, graph, string, and geometric algorithms. (Formerly Computer Science 102.)
Quarter offered
Fall, Winter, Spring
Instructor
The Staff, Manfred Warmuth, Allen Van Gelder, Suresh Lodha, David Helmbold, Daniel Fremont, Abhradeep Guha Thakurta