Objective Scoring for Computing Competition Tasks | Zendy

Graeme Kemkes | Zendy; Troy Vasiga | Zendy; Gordon V. Cormack | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Objective Scoring for Computing Competition Tasks

Author(s) -

Graeme Kemkes,

Troy Vasiga,

Gordon V. Cormack

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-48218-0

DOI - 10.1007/11915355_22

Subject(s) - olympiad , computer science , competition (biology) , informatics , artificial intelligence , machine learning , mathematics education , mathematics , electrical engineering , engineering , ecology , biology

Computing competitions like the International Olympiad in Informatics (IOI) typically pose several problems that contestants are required to solve by writing a program. The program is tested automatically on several sets of input data to determine whether or not it computes the correct answer within specified time and memory limits. We consider the controversy of whether and how to award partial credit for programs that fail some of the tests. Using item response theory, we analyze the degree to which the scores from these automatic tests, separately and in various combinations, truly reflect the contestants' achievement.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research