This shows you the differences between two versions of the page.
|
competitive_programming [2010/03/08 11:21] jtkorb |
competitive_programming [2010/09/09 11:51] (current) jtkorb |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== CS 39000-004: Competitive Programming ====== | + | ====== CS 39000-CP0: Competitive Programming ====== |
| {{contest-course-flyer-2010.pdf|Advertising Flyer}} | {{contest-course-flyer-2010.pdf|Advertising Flyer}} | ||
| - | **This course is scheduled to be offered in fall 2010. Topics and other details below to be updated.** | + | Course meetings (pick one): |
| + | * Thursdays, 3:00-5:50, LWSN B146 | ||
| + | * Fridays, 8:30-11:20, LWSN B158 | ||
| - | Course meetings now scheduled: Tuesdays, 3:00-5:50, LWSN B158. | + | Development of strategies, techniques, and skills used in competitive programming contests. Topics include problem solving and programming techniques and algorithms. Course format consists of a weekly meeting that includes brief discussion, followed by a practice programming contest, and a wrap-up discussion. |
| - | Development of strategies, techniques, and skills used in competitive programming contests. Topics include problem solving and programming techniques and algorithms. Course format consists of a weekly meeting that includes lecture (30 minutes), programming practice (two hours), and discussion (20 minutes). | + | Grading is based largely on weekly attendance (required) and class participation (encouraged). |
| Credit: 1 hour. Prerequisite: CS 25100 (Data Structures). | Credit: 1 hour. Prerequisite: CS 25100 (Data Structures). | ||
| - | Topics by week (based on Skiena textbook and course): | + | Topics by week (based on Skiena textbook and course; subject to change): |
| - | - [[Getting Started]] | + | - [[https://docs.google.com/present/edit?id=0AcVsm1lcySCMZHB2djg1cF80NWM2NmM0NDZ2&hl=en&authkey=CPWxqcQK|Getting Started]] |
| - | - {{cp-090901.pdf|Data Structures}} | + | - Data Structures |
| - | - {{cp-090908.pdf|Strings}} | + | - Strings; [[contest_2010-09-09|Thursday Contest]] |
| - | - {{cp-090915.pdf|Sorting}} | + | - Sorting |
| - | - {{cp-090922.pdf|Arithmetic}} | + | - Arithmetic |
| - | - {{cp-090929.pdf|Combinatorics}} | + | - Combinatorics |
| - | - {{cp-091006.pdf|Number Theory}} | + | - Number Theory |
| - | - {{cp-091020.pdf|Contest Strategies/Backtracking}} | + | - Contest Strategies/Backtracking |
| - | - {{cp-091027.pdf|ICPC Logistics and Practice Contest}} | + | - ICPC Logistics and Practice Contest |
| - | - [[Geometry|Geometry]] | + | - Geometry |
| - | - {{cp-091110.pdf|Review of ACM ICPC RPC Problems}} | + | - Review of ACM ICPC RPC Problems |
| - | - {{cp-091117.pdf|Amazon Ninja problems, Dynamic Programming, Grids}} | + | - Amazon Ninja problems, Dynamic Programming, Grids |
| Other topics: | Other topics: | ||
| Line 32: | Line 34: | ||
| - Computational Geometry | - Computational Geometry | ||
| - | The top students in the class will represent Purdue at the regional ACM International Collegiate Programming Competition in November, 2009. | + | The top students in the class will represent Purdue at the regional ACM International Collegiate Programming Competition in November, 2010. |
| Textbook: //[[http://www.amazon.com/exec/obidos/ASIN/0387001638/thealgorithmrepo|Programming Challenges]]//, Steven S. Skiena and Miguel Revilla, Springer, 2003 (ISBN 978-0387001630). | Textbook: //[[http://www.amazon.com/exec/obidos/ASIN/0387001638/thealgorithmrepo|Programming Challenges]]//, Steven S. Skiena and Miguel Revilla, Springer, 2003 (ISBN 978-0387001630). | ||
| - | [[check_enrollment|Instructions to Check Enrollment]] | + | ====== Other Notes ====== |
| + | |||
| + | There are 19 problems that are not correctly judged by the Programming Challenges (PC) website (http://www.programming-challenges.com). Here are the problems with the corresponding UVA (http://uva.onlinejudge.org/) problem number in parenthesis: | ||
| + | |||
| + | 110104 (706) | ||
| + | 110204 (843) | ||
| + | 110208 (10149) | ||
| + | 110307 (10150) | ||
| + | 110402 (120) | ||
| + | 110403 (10037) | ||
| + | 110407 (10152) | ||
| + | 110508 (10202) | ||
| + | 110705 (10168) | ||
| + | 110802 (10181) | ||
| + | 110808 (10270) | ||
| + | 110906 (10051) | ||
| + | 111002 (10054) | ||
| + | 111007 (10249) | ||
| + | 111008 (10092) | ||
| + | 111101 (10131) | ||
| + | 111106 (10261) | ||
| + | 111305 (10167) | ||
| + | 111307 (10209) | ||
| + | |||
| + | This list is documented [[http://www.programming-challenges.com/bb/viewtopic.php?f=1&t=7|here]]. | ||