Listed in: Computer Science, as COSC-311
Kristy Gardner (Section 01)
John E. Rager (Section 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. Professors Gardner and McGeoch.
Section 01
M 11:00 AM - 11:50 AM SMUD 206
W 11:00 AM - 11:50 AM SMUD 206
F 11:00 AM - 11:50 AM SMUD 206
Section 02
Tu 09:00 AM - 09:50 AM SCCE A131
Th 09:00 AM - 09:50 AM SCCE A131
Section 02
F 09:00 AM - 09:50 AM SCCE A131