Description

Lecture, three hours; discussion, one hour. Requisite: course 3C or 32A, and 61. Not open for credit to students with credit for Computer Science 180. Graphs, greedy algorithms, divide and conquer algorithms, dynamic programming, network flow. Emphasis on designing efficient algorithms useful in diverse areas such as bioinformatics and allocation … For more content click the Read More button below.

Instructional Format

Primary Format

Lecture

Secondary Format

Discussion

Credit Exclusions

COM SCI 180 - Introduction to Algorithms and Complexity

Not open for credit to students with credit for any course listed here.