Listed in: Computer Science, as COSC-311
Kristy Gardner (Section 01)
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.
Section 01
M 12:00 PM - 12:50 PM SMUD 206
W 12:00 PM - 12:50 PM SMUD 206
F 12:00 PM - 12:50 PM SMUD 206
Section 01
Th 12:00 PM - 12:50 PM SMUD 206