User Tools

Site Tools


competitive_programming_2014

This is an old revision of the document!


CS 39000-CP0: Competitive Programming

Development of strategies, techniques, and skills used in competitive programming contests. Topics include problem solving and programming techniques and algorithms. Course format consists of weekly meetings that include brief discussion, problem solving and programming practice, a practice programming contest, and a wrap-up discussion.

Grading is pass/fail and based on class attendance and participation, problem solving skills, and programming contest progress and results.

Credit: 1 hour. Prerequisite: CS 25100 (Data Structures and Algorithms).

Text: Competitive Programming 3, by Halim and Halim, Lulu, 2013. 3rd edition.

Meeting Time: Fridays, 1:30-4:20 through November 7, 2014. Place: LWSN B148.

Tools and Resources

Course/Lab Meetings and Events (Required)

  • Weekly attendance in lab (Fridays, 1:30-4:20; students enrolled in Software Testing are allowed to leave early)
  • Participation in ACM ICPC qualification contest, Saturday, September 27, 2014. This five-hour competition is online 3:00 PM to 7:00 PM ET; location TBD
  • For those who qualify: Participation in the ACM ICPC regional competition in Cincinnati, Ohio, November 7-8. Leave campus at 1:00 PM on the 7th, return by 9:00 PM the 8th)

Weekly Notes

In reverse chronological order…

  • [09/26]: Problem-Solving Paradigms slides Contest (code 1313)
  • [09/19]: Data Structures Part 2 slides Contest (code 1337)
  • [09/12]: Data Structures Part 1 slides Contest (code 4321)
  • [09/05]: “Ad Hoc” problems. Slides Contest (code 345)
  • [08/29]: Course introduction and “getting started” problems. Slides Contest (code 123)
competitive_programming_2014.1411744323.txt.gz · Last modified: 2014/09/26 08:12 by jtkorb