Lecture, four hours; outside study, eight hours. Requisite: course 180. Additional requisites for each offering announced in advance by department. Selections from design, analysis, optimization, and implementation of algorithms; computational complexity and general theory of algorithms; algorithms for particular application areas. Subtitles of some current sections: Principles of Design and Analysis (280A); Distributed Algorithms (280D); Graphs and Networks (280G). May be repeated for credit with consent of instructor and topic change. Letter grading.

Review Summary

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

Enrollment Progress

Enrollment data not available.

Course

Instructor
Eliezer M. Gafni
Previously taught
19S 18W 17W 15F 14W 13W 12W 11W 09F 08F 07S 06S 05S 03W 02W 00S

Previous Grades

Grade distributions not available.