<p>Lecture, four hours; discussion, two hours; outside study, six hours. Enforced requisites: course 32, Mathematics 61. Designed for junior/senior Computer Science majors. Introduction to design and analysis of algorithms. Design techniques: divide-and-conquer, greedy method, dynamic programming; selection of prototypical algorithms; choice of data structures and representations; complexity measures: time, space, upper, lower bounds, asymptotic complexity; NP-completeness. Letter grading.</p>

Computer Science

Known as the birthplace of the Internet and where countless other cutting-edge technologies took their first steps, the school is consistently ranked among the top 10 public engineering schools in the U.S.

Henry Samueli School of Engineering and Applied Science

Computer science is concerned with the design, modeling, analysis, and applications of computer systems.

General Catalog

Introduction to Algorithms and Complexity

COMSCI180

4 units