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 of resources. P/NP or letter grading.

Review Summary

Clarity
N/A
Organization
N/A
Time
N/A
Overall
N/A

Enrollment Progress

Jul 10, 11 PM PDT
LEC 1: 40/40 seats taken (Full)
Priority PassFirst PassSecond Pass0 days3 days7 days11 days15 days17 days21 days25 days0204060

Section List

  • LEC 1

    Full

    MWF 9am-9:50am

    Kinsey Science Teaching Pavilion 1200B

Course

Instructor
Patrick Lutz
Previously taught
21F

Previous Grades

Grade distributions not available.

Textbooks

Textbook information not available.