CSC317 Competitive Programming

[3–0, 3 cr.]

This course introduces techniques and skills needed to solve algorithmic problems in a competitive problem-solving environment.  Topics include techniques for attacking and solving challenging computational problems, functional programming, essential mathematics-related problems, data structures, greedy and dynamic programming, combinatorial games, graph algorithms, network flow problems, computational geometry, and string algorithms.

Prerequisite: CSC310 Algorithms and Data Structures and CSC310B Algorithms and Data Structure Lab.

Note: This course has not been taught since Fall 2021 and will not be taught during the academic year 2023-2024.