Search

Published After
Published Before

Search Results

  • An evaluating tool for programming contests
    103-119
    Views:
    8
    Students of the University of Debrecen majoring in informatics have been participating in regional ACM international collegiate programming contests since 1995. In earlier times arrangement of the local rounds was difficult because we had to check the contestants' submissions by hand. Beyond the discomfort, this hindered the efficient work of the jury and involved a number of possibilities of making mistakes.
    The Programming Contest Result Manager (PCRM) program developed in the past two years provides a solution to the above problems. The program automates the evaluation of submissions and provides both the jury and the contestants with a user interface. This application can help the jury not only in ACM type but also in other kinds of practical programming contests.
  • How to use our own program evaluation system to streamline teaching computer programming
    73-80
    Views:
    35
    During computer programming contests the use of automatic evaluation systems is becoming more and more frequent. In said systems the contestants are allowed to submit their source code that will be evaluated with the results reported back to them. According to this report the contestant can realise for what test cases his program works properly and for what cases does it fail. This kind of on-line evaluation system is used for example in the International Olympiad in Informatics (IOI), in the final round of the Nemes Tihamér National Programming Competition, and in the Selection Competition for IOI in Hungary. A contest management system can be used for other purposes apart from this singular example. A well-developed evaluation system can foster not only the teaching of computer programming and the preparation of students for programming contests but the teacher's work as well.
  • Organizing programming contests
    73-99
    Views:
    28
    This paper aims to summarize my experience in organizing programming contests. It is an overview of those questions that should be raised and decisions that should be made by organizers, teachers and computer system administrators, who participate "on the other side" of such events.
  • Algorithmics of the knapsack type tasks
    37-71
    Views:
    28
    We propose a new kind of approach of the teaching of knapsack type problems in the classroom. We will remind you the context of the general knapsack-task and we will classify it, including the two most popular task variants: the discrete and the continuous one. Once we briefly present the solving algorithm of the continuous variant, we will focus on the solving of the discrete task, and we will determine the complexity of the algorithms, looking for different optimizing possibilities. All these issues are presented in a useful way for highschool teachers, who are preparing students in order to participate in different programming contests.