CSI 4144: Competitive Learning, Spring 2016
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.
Lectures are from 14:30 to 15:20 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.
You will submit your solutions to Baylor's Kattis Judge. You may need to create an account, and will then register for the course.
Here is a schedule of the material we will cover. Please visit Kattis to see the assignments for the week.
- Introduction to Problem Solving.
Reading: chapter 1.
- Elementary Data Structures — The C++ Standard Template Library or Java Collections, including sequence containers, iterators and basic template algorithms.
- Sorted associative set and map data structures and their implementations in C++ STL or Java Collections.
Problem ideas due for 2nd/3rd semester students.
- Strings and string algorithms, searching, sorting.
- First Local Contest.
- Sorting and applications to uniqueness testing, deleting duplicates, selection, efficient searching, and set intersection/union.
Begin work in teams.
- Arithmetic and algebra, big number implementation, prime factorization.
- Arithmetic and algebra, number theory, counting problems, modular arithmetic.
- Simulation problems.
- No meeting (Spring break); no problems assigned
- Second Local Contest.
Complete drafts of problem packages due for 2nd/3rd semester students.
- Elementary Search Topics, recursive depth-first search, combination and permutation generation, state space traversal.
- Intermediate Search Topics, search pruning and ordering.
- No meeting (Diadeloso) Disjoint set data structure, path compression algorithm, and applications.
- Representing, counting, and computing on grid-oriented data; rectangular, hexagonal, and triangular grids.
- Final Local Contest.
Final problem packages due for 2nd/3rd semester students.
Textbooks & resourcesThe textbook for this course is Competitive Programming by Steven Halim and Felix Halim (Edition 1 is free online, editions 2 and 3 are inexpensive).
The following books may also 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.
Other online programming contest software:
- Open Kattis -- this is the software used to judge the ACM ICPC contest world finals
Other 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.
- STL cheatsheet 1: vectors, pairs, iterators, algorithms
- STL cheatsheet 2: sets, maps, stringstreams
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
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 (hidden) tests on the judge.
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.
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.
The reason we use Kattis problem package format is due to the set of tools that are available for verifying problem integrity. You should get and install them from github on the Kattis problemtools project page. (They are easiest to install on Ubuntu.) As the problemtools package uses a Git submodule, to get the full source you need to use the following command to get all the sources you'll need:
git clone --recursive firstname.lastname@example.org:Kattis/problemtools.gitAfter installing it, use this software to verify your problem package before submitting it to me. This means running "verifyproblem.py" to verify the entire problem package. You can also use "problem2pdf.py" to see how your problem writeup looks when rendered in PDF.
There are multiple deadlines for problem writeups, which are listed on the schedule above:
- The first deadline is a 1-2 paragraph description of the problem idea(s), including the motivation, type of problem (search, shortest path, dynamic programming, etc.), and the basic story outline for the problem.
- The second deadline ("Complete draft") means all parts of the problem package(s) should be written -- solution, writeup, input verifier, problem data, etc. The package should verify with Kattis problemtools "verifyproblem". I will evaluate these and send feedback for the final version.
- The deliverable of the final deadline is the same as that of the complete draft, except it should be highly polished and in final form. Even with a complete draft that is in good shape, getting a well-crafted problem can be a lot of work, so don't put off working on this.
Here are some additional thoughts and guidelines on how to write programming contest problems.
- 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.
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.
- 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 © 2016 Greg Hamerly, with some content
taken from a syllabus by Jeff Donahoo.
Computer Science Department