Fall 2007


Listed in: Computer Science, as COSC-31


Catherine C. McGeoch (Section 01)


This course addresses the design and analysis of computer algorithms. Although theoretical analysis is emphasized, implementation and evaluation techniques are also covered. Topics include: set algorithms such as sorting and searching, graph traversal and connectivity algorithms, string algorithms, numerical algorithms, and matrix algorithms. Algorithm design paradigms will be emphasized throughout the course. The course will end with a discussion of the theory of NP-Completeness and its implications. Four class hours per week. Requisites: Computer Science 21 and Mathematics 15, 26, or 28 or consent of the instructor. First semester. Professor C. McGeoch.