CS 491 CAP
CS 491 CAP - Adv Competitive Algorithm Prog
|Adv Competitive Algorithm Prog||CS491||CAP||65816||OLB||3||0930 - 1045||M W||Mattox Alan Beckman|
Seminar on topics of current interest as announced in the Class Schedule. Course Information: 0 to 4 undergraduate hours. 0 to 4 graduate hours. Approved for S/U grading only. May be repeated in the same or separate terms if topics vary to a maximum of 4 hours. Prerequisite: As specified for each topic offering, see Class Schedule or departmental course description.
There will be asynchronous recorded lectures and additional synchronous online activities. Title: Introduction to Competitive Algorithmic Programming This course introduces the algorithms and concepts necessary to compete effectively in the ACM International Collegiate Programming Contest (ICPC) and similar contests. It is highly recommended for students intending to compete in the 2016 ICPC Mid-Central Regional contest. The course requires participation in practice contests and weekly completion of short problem sets. Topics covered include standard library classes and data structures useful for programming contest problems, basic complexity analysis, dynamic programming, graph algorithms, number theory, combinatorics, computational geometry, combinatorial games, and competitive programming contest strategy. Prerequisites: Must have programming competency in Java or C++ and preferably have taken CS 225 Data Structures.