z-logo
open-access-imgOpen Access
Classificação de dificuldade de questões de programação com base na inteligibilidade do enunciado
Author(s) -
Pedro dos Santos,
Leandro Silva Galvão de Carvalho,
Elaine Oliveira,
David Fernandes
Publication year - 2019
Publication title -
anais do xxx simpósio brasileiro de informática na educação (sbie 2019)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5753/cbie.sbie.2019.1886
Subject(s) - humanities , philosophy , sociology
In large programming classes mediated by online judges, one must randomize the chosen questions for evaluation tests, in order to avoid dishonest behavior. The problem of a naive randomization is the lack of equity in respect to the degree of difficulty of the questions. Thus, this paper proposes a method to classify the difficulty of programming questions based on textual intelligibility metrics extracted from their statements. In total, 450 questions were analyzed, and those were answered by 800 students in a introduction to programming discipline between the academic periods of 2017 to 2018. It was verified that an approach based only on the intelligibility metrics is suboptimal for the classification of difficulty of questions, but not irrelevant.

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom