OLYMPIADS IN INFORMATICS, 2019, Vol. 13, pp. 145 - 156
© IOI, Vilnius University
ISSN 1822-7732
DOI: 10.15388/ioi.2019.09
Analyzing Task Difficulty in a Bebras Contest Using Cuttle
Willem van der VEGT1, Eljakim SCHRIJVERS2
1Dutch Olympiad in Informatics, Windesheim University for Applied Sciences
PO Box 10090, 8000 GB Zwolle, The Netherlands
2Dutch Olympiad in Informatics, Eljakim IT
PO Box 85183, 3508 AD Utrecht, The Netherlands
e-mail: w.van.der.vegt@windesheim.nl , eljakim@cuttle.org
Abstract
Predicting the difficulty level of a task on the concepts of computer science or computational thinking, like in the Bebras Challenge, proves to be really hard. But the announced difficulty level is needed in the contest format used in many local challenges. The Dutch contest system Cuttle has a new module for analysis. This is applied to one specific contest in order to find parameters explaining task difficulty. Using quantitative methods we were able to confirm a relation between answer types and difficulty and a tendency that tasks on data, data structures and representation are better answered than tasks on algorithms and programming.
Keywords:
Bebras contest, answer types, question difficulty, P-value, Rit-value, contest system.
To preview full
article text in PDF format click here
You
could obtain free Acrobat Reader from Adobe
Copyright © International Olympiad in Informatics, 2019
Vilnius University, 2019