Listed in: Computer Science, as COSC-311
Kristy Gardner (Sections 01 and 02)
Siheng Li (Sections 01 and 02)
Mackenzie A. Stein (Sections 01 and 02)
This course addresses the design and analysis of computer algorithms. Topics include: set algorithms such as sorting and searching, graph algorithms, string algorithms, and matrix algorithms. Algorithm design paradigms, including the divide-and-conquer, dynamic programming, and greedy paradigms, will be emphasized. The course will end with a discussion of the theory of NP-completeness and its implications.
Requisite: COSC 112 and COSC 211. Fall semester. Professor Gardner.