CSI 4v96: Competitive Learning, Fall 2014


This course is a topics course in problem solving and algorithms. It is modeled on the collaborative and competitive environments at the ACM International Collegiate Programming Contest. Each week we will discuss a topic, and the assignments will be programming-based problems related to that topic.

Practical information

Lectures are from 3:30 to 4:20 PM in Rogers 113 on Tuesdays.

My office is in the Rogers Engineering and Computer Science building, and office hours are listed on my home page. I am glad to talk to students during and outside of office hours. If you can't come to my office hour, please make an appointment for another time, or just stop by.


Here is a schedule of the material we will cover. As the semester progresses, the relevant problems will be listed under each topic.

  1. Week 1 (Tuesday, Aug 26): Introduction to Problem Solving.
  2. Week 2 (Tuesday, Sep 2): Elementary Data Structures — The C++ Standard Template Library or Java Collections, including sequence containers, iterators and basic template algorithms. Problems marked with * are on more advanced topics.
  3. Week 3 (Tuesday, Sep 9): Sorted associative set and map data structures and their implementations in C++ STL or Java Collections. Problem ideas due for 2nd/3rd semester students. Problems marked with * are on more advanced topics.
  4. Week 4 (Tuesday, Sep 16): Input and output.
  5. Week 5 (Tuesday, Sep 23): No class meeting; meet Saturday 9/27 at 2:00 PM in room 214 for ICPC North American Qualifier.
  6. Week 6 (Tuesday, Sep 30): Introduction to graphs — representation, elementary algorithms (DFS, BFS, loop detection, topological sort). Start group work this week.
  7. Week 7 (Tuesday, Oct 7): Problems from the 2014 ICPC SCUSA Regional Competition (see Problem Statements; use problem IDs 'scusa2014ancient', 'scusa2014cipher', 'scusa2014factorial', 'scusa2014map', 'scusa2014optic', 'scusa2014palindrome', 'scusa2014resources', 'scusa2014runners').
  8. Week 8 (Tuesday, Oct 14): Intermediate graph algorithms, spanning trees, shortest paths.
  9. Week 9 (Tuesday, Oct 21): Introduction to computational geometry, basic representation, vector operations, proximity tests.
  10. Week 10 (Tuesday, Oct 28): Intermediate computational geometry, angle problems, convex polygons, intersection problems. Complete drafts of problem statements due for 2nd/3rd semester students.
  11. Week 11 (Tuesday, Nov 4): Advanced computational geometry, convex hull, closest pair of points.
  12. Week 12 (Tuesday, Nov 11): Introduction to dynamic programming, elementary algorithms, memoization.
  13. Week 13 (Tuesday, Nov 18): Dynamic programming, additional algorithms, theory and algorithm development.
  14. Week 14 (Tuesday, Nov 25): No class meeting; catch up on previous problems.
  15. Week 15 (Tuesday, Dec 2): Final local contest. Block out 3 hours with your partner to try these new problems and revisit these previously-unsolved problems.

Textbooks & resources

There is no required text for this course. However, the following books may be useful:

Further online resources:

Course handouts

Project submissions

To submit your projects, use the upload site. Log in with your normal BearID and password. There you should find two options: submission for a Java project, or submission for a C++ project. For Java, your main class should be public and should be called Driver.

We will use the same upload assignment to submit and test all the projects. So that the upload site can tell which project you're submitting, you should include in your source a comment with the following text:


where N is the three-digit assignment number (e.g. 070 or 289). If you don't set this correctly, your code will not be evaluated correctly. When you click test, the upload site will compile and evaluate your code, and email you the response.


Grades will be assigned based on the following breakdown:

Final letter grades will be assigned at the discretion of the instructor, but here is a minimum guideline for letter grades:
A: 90-100, B+: 88-89, B: 80-87, C+: 78-79, C: 70-77, D: 60-69, F: 0-59

Solving problems

Each problem completed within 1 week of it being assigned earns 2 points. Each problem not completed within a week but completed by the end of the semester earns 1 point. Completing a program means passing the tests on the upload site.

For weeks designated as "contests", the problems will not be publicly posted to the web. You should choose a 3 hour window during which you plan to work on the problems. Send your professor an email about 24 hours in advance of this time, and he will send you the problems via email. Then work on the problems during your chosen time frame.

Writing problems

Students taking the course for the second (third) semester must develop one (two) problems of their own. Use the Kattis problem package and fill in the relevant parts. In particular, your writeup should have:

These problems are due at the last class meeting of the semester. You must also submit via email to the professor your ideas for your problem(s) the 3rd class meeting, and a draft of the completed writeup on the 10th meeting.


Academic honesty

I take academic honesty very seriously. Many studies, including one by Sheilah Maramark and Mindi Barth Maline have suggested that "some students cheat because of ignorance, uncertainty, or confusion regarding what behaviors constitute dishonesty" (Maramark and Maline, Issues in Education: Academic Dishonesty Among College Students, U.S. Department of Education, Office of Research, August 1993, page 5). In an effort to reduce misunderstandings, here is a minimal list of activities that will be considered cheating in this class:

Copyright © 2014 Greg Hamerly, with some content taken from a syllabus by Jeff Donahoo.
Computer Science Department
Baylor University

Valid html and css.