Computer Science 311 - Algorithms

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 211 or consent of the instructor. Fall semester: Professor Kryven. Spring semester: Professor Gardner.

How to handle overenrollment: Priority to majors. First senior majors, junior majors.

Students who enroll in this course will likely encounter and be expected to engage in the following intellectual skills, modes of learning, and assessment: Quantitative work.