Informatics in Education Logo

INFORMATICS IN EDUCATION
International Journal

Main Page
Editorial Board
Instructions to Authors


Contents
Author Index
Papers in Production

INFORMATICS IN EDUCATION, 2006, Vol. 5, No. 1, 5-14
© Institute of Mathematics and Informatics,

ISSN 1648-5831

Random Factors in IOI 2005 Test Case Scoring

Gordon CORMACK

David R. Cheriton School of Computer Science, University of Waterloo Waterloo Ontario N2L 3G1, Canada E-mail: gvcormac@uwaterloo.ca

Abstract

We examine the precision with which the cumulative score from a suite of test cases ranks participants in the International Olympiad in Informatics (IOI). Our concern is the ability of these scores to reflect achievement at all levels, as opposed to reflecting chance or arbitrary factors involved in composing the test suite. Test cases are assumed to be drawn from an infinite population of similar cases; variance in standardized rank is estimated by the bootstrap method and used to compute confidence intervals which contain the hypothetical true ranking with 95% probability. We examine the relative contribution of easy (so-called fifty-percent rule) cases and hard cases to the overall ranking. Empirical results based on IOI 2005 suggest that easy and hard cases are both material to the ranking, but the proportion of each is unimportant.

Keywords:

informatics olympiad, programming contest, classical test theory


PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe


TopTop Copyright © INFORMATICS IN EDUCATION, Institute of Mathematics and Informatics, 2013