Fall 2021


Listed in: Computer Science, as COSC-311

Moodle site: Course


John E. Rager (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 Rager.


2022-23: Not offered
Other years: Offered in Fall 2017, Fall 2018, Fall 2019, Fall 2020, Fall 2021