CSI 4v96: Competitive Learning, Fall 2013

Overview

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.

Schedule

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 27): Introduction to Problem Solving
   • 000 — More or Less
   • 312 — Detailed differences
   • 035 — Fouled files
   • 274 — Volume amplification
   • 062 — Permutation encryption
2. Week 2 (Tuesday, Sep 3): 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.
   • 002 — Path Tracing
   • 037 — Compound Words
   • 063 — Sort of sorting
   • 027* — Pegs
   • 094* — Drainage
   • 095* — All different directions
3. Week 3 (Tuesday, Sep 10): Sorted associative set and map data structures and their implementations in C++ STL or Java Collections Problems marked with * are on more advanced topics.
   • 003 — Adding words
   • 004 — Engineering English
   • 116 — Metaprogramming
   • 023* — Rocking Chair
   • 212* — Once-In-A-Lifetime
   • 259* — Bucket Brigade
4. Week 4 (Tuesday, Sep 17): Input and output
   • 036 — Word Search
   • 038 — Structural differences
   • 123 — Connect the dots
   • 293 — Musical notation
5. Week 5 (Tuesday, Sep 24): Introduction to graphs — representation, elementary algorithms (DFS, BFS, loop detection, topological sort)
   • 087 — Managing packaging
   • 180 — Well-defined functions
   • 189 — Reachable roads
6. Week 6 (Tuesday, Oct 1): No class meeting; meet Saturday 10/5 in room 214 for ICPC North American Qualifier (2-7 PM)
7. Week 7 (Tuesday, Oct 8): Intermediate graph algorithms, spanning trees, shortest paths
   • 009 — Longest shortest paths
   • 048 — Unique MSTs
   • 264 — Intragalactic shipping routes
8. Week 8 (Tuesday, Oct 15): Introduction to computational geometry, basic representation, vector operations, proximity tests
   • 017 — Hurricane danger!
   • 018 — Pachyderm peanut packing
   • 056 — RectSect
   • 057 — Splat
   • 107 — Flea-Line
9. Week 9 (Tuesday, Oct 22): Intermediate computational geometry, angle problems, convex polygons, intersection problems
   • 100 — Tissue Paper Triangles
   • 170 — Rounded Buttons
   • 183 — Convex polygon area
10. Week 10 (Tuesday, Oct 29): No class meeting; meet Saturday 11/2 for the ICPC Regional Competition
11. Week 11 (Tuesday, Nov 5): Advanced computational geometry, convex hull, closest pair of points
    • 101 — Darts
    • 267 — Robot protection
12. Week 12 (Tuesday, Nov 12): Introduction to dynamic programming, elementary algorithms, memoization
    • 102 — Generalized recursive functions
    • 115 — Maximizing (and minimizing) your winnings
    • 194 — Increasing Subsequence
13. Week 13 (Tuesday, Nov 19): Dynamic programming, additional algorithms, theory and algorithm development
    • 193 — Pachinko probability
    • 198 — Recursion + Rand = !Fun
    • 204 — Balanced Diet
14. Week 14 (Tuesday, Nov 26): No class meeting; catch up on previous problems
15. Week 15 (Tuesday, Dec 3): Final local contest. Block out 3 hours with your partner to revisit these previously-unsolved problems.
    • 027 — Pegs
    • 036 — Word Search
    • 094 — Drainage
    • 100 — Tissue Paper Triangles
    • 107 — Flea-Line
    • 123 — Connect the dots
    • 180 — Well-defined functions
    • 198 — Recursion + Rand = !Fun
    • 212 — Once-In-A-Lifetime
    • 259 — Bucket Brigade
    • 264 — Intragalactic shipping routes

Textbooks & resources

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

• Programming Challenges by Steven Skiena
• The Algorithm Design Manual by Steven Skiena
• Introduction to Algorithms by Cormen et al.
• Programming Pearls by Jon Bentley
• Any other data structures, algorithms, and language reference books.

Further online resources:

• Bruce Eckel, Thinking in C++ (2nd edition)
• the Standard Template Library (STL) reference
• Project submission guidelines and coding style guidelines for this course.

Course handouts

• STL cheatsheet 1: vectors, pairs, iterators, algorithms
• STL cheatsheet 2: sets, maps, stringstreams

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:

ASSIGNMENT N

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.

Grading

Grades will be assigned based on the following breakdown:

• First semester students:
  • # of problems completed: 100%
• Second and third semester students:
  • # of problems completed: 80%
  • problem(s) developed: 20%

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:

• A Latex writeup.
• At least one correct, efficient, well-structured, well-commented, one-file solution in C++ or Java.
• Possibly other submissions that highlight incorrect solutions (wrong answer, too much time, etc.)
• Files containing sample and secret inputs (each having suffix ".in"). The size of all inputs combined should be less than 500 Kb.
• Files containing sample and secret outputs (each having suffix ".ans"). The size of all inputs combined should be less than 500 Kb.
• An input format validator. It should use exit code 42 when the input file is correctly formatted, another exit code when there is a problem.
• A test case generator which generates input file (may be written in C++, Java, Perl, or Python). This should probably have some hand-made test cases hard coded in, as well as some randomly created test cases.
• An appropriately filled-in problem.yaml file.

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.

Policies

• This website contains the official course information. Please check it regularly for updates.
• All work in this course is strictly individual, unless the instructor explicitly states otherwise. While discussion of course material is encouraged, collaboration on assignments is not allowed. Collaboration includes (but is not limited to) discussing with anyone (other than the professor) anything that is specific to completing an assignment. You are encouraged to discuss the course material with the professor, preferably in office hours, and also by email.
• Bring any grading correction requests to your professor's attention within 2 weeks of receiving the grade or before the end of the semester, whichever comes first.

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:

• Using a source other than the optional course textbooks, the course website, or your professor to obtain credit for any assignment.
• Copying another student's work. Simply looking over someone else's source code is copying.
• Providing your work for another student to copy.
• Collaboration on any assignment, unless the work is explicitly given as collaborative work. Any discussion of an assignment or project is considered collaboration.
• Plagiarism.
• Studying tests or using assignments from previous semesters.
• Providing someone with tests or assignments from previous semesters.
• Turning in someone else's work as your own work.
• Giving test questions to students in another class.
• Reviewing previous copies of the instructor's tests without permission from the instructor.

---

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

Valid html and css.