Computer Science and EngineeringCSE 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.)

Requirements

Prerequisite(s): CSE 101.

Credits

5

Quarter offered

Fall, Winter, Spring

Instructor

The Staff, Manfred Warmuth, Allen Van Gelder, Suresh Lodha, David Helmbold, Demetrios Achlioptas, Abhradeep Guha Thakurta