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.)
Enrollment Requirements
Prerequisite(s): CSE 101.
Class Notes
Enrollment is restricted to current UCSC students only. If you completed the prerequisites but get an error message, email your proof of prerequisite material to the department at advising@soe.ucsc.edu for approval to enroll.