Non-competitive programming contest problems as the basis for just-in-time teaching

Abstract

We report on the successful use of small programming assignments that augment a just-in-time approach to teaching programming, and problem solving in the first year of computer science. The emphasis in these assignments is on algorithmic problem-solving rather than on object-oriented design and programming. Students are given a terse explanation of a problem and several non-exhaustive test cases. A programmed solution uses no I/O, but is tested via a Web-based submission system that reports success or failure for between 10 and 40 test cases. Students compile, test, and debug via the online Web-based system. There is no limit on the number of times students can test their solutions. After submission for grading, solutions are judged solely on whether they pass tests, all of which can be seen via the online testing mechanism, and not on the so-called quality of the code submitted.