CS-2144: Competitive Problem Solving I
Description: Fundamentals of algorithms, data structures, and implementation techniques, taught in a setting that combines collaborative practice with competitive exercise. Students practice to solve problems using a computer, which are judged by automated evaluation software for correctness and efficiency. Practice with data structures including arrays, lists, maps, and trees, as well as algorithmic strategies including recursion, divide-and-conquer, dynamic programming, search and traversal algorithms, graph representations, and computational geometry. Macro- and micro optimization techniques to improve efficiency are emphasized.
Pathways: N/A
Course Hours: 3 credits
Corequisites: N/A
Crosslist: N/A
Repeatability: N/A
Sections Taught: 4
Average GPA: 3.78 (rounds to A-)
Strict A Rate (No A-) : 69.35%
Average Withdrawal Rate: 12.49%
| Godmar V Back | 2024 | 69.4% | 15.7% | 2.5% | 0.0% | 0.0% | 12.5% | 3.78 | 4 |