 | Use this page to maintain syllabus information, learning objectives, required materials, and technical requirements for the course. |
| CS 41100 - Competitive Programming III |
|---|
|
Associated Term:
Spring 2024
Learning Outcomes: 1. Differentiate between advanced categories of problems in computer science including network flow, computational geometry, graph matching, and NP-hard problems, as well as subcategories in each of these categories. 2. Extrapolate generalized solutions and problem-solving strategies across advanced categories listed in LO1 as well as in general competitive programming categories. 3. Design algorithms to solve problems that span multiple advanced categories of problems, combining categorical solutions in complex ways. 4. Use new/novel algorithms to solve advanced problems. 5. Deconstruct an advanced problem into subproblems that can be solved individually. 6. Quickly determine runtime and space usage of a potential solution using big-O notation to judge if the potential solution will work. 7. Create an efficient solution to a problem based on analysis of the problem type, the deconstructed problem parts, and the time and space constraints of the problem. 8. Communicate ideas quickly and concisely to other competitive programmers to create efficient solutions. Required Materials: Technical Requirements: |
| Return to Previous | New Search |
 |