An introduction to the design and analysis of fundamental algorithms. General techniques covered: divide-and-conquer algorithms, dynamic programming, greediness, probabilistic algorithms. Topics include: sorting, searching, graph algorithms, compression, cryptography, computational geometry, and NP-completeness.

Units: 1

Max Enrollment: 24

Prerequisites: (CS 230, CS 230P, or CS 230X) and MATH 225, or permission of the instructor.

Instructor: Staff

Distribution Requirements: MM - Mathematical Modeling and Problem Solving

Typical Periods Offered: Spring; Fall

Semesters Offered this Academic Year: Spring; Fall

Notes: