Measuring Difficulty of Introductory Programming Tasks

• Autoři: EFFENBERGER Tomáš; ČECHÁK Jaroslav; PELÁNEK Radek
• Rok publikování: 2019
• Druh: Článek ve sborníku
• Konference: Proceedings of the Sixth (2019) ACM Conference on Learning @ Scale (L@S '19)
• Fakulta / Pracoviště MU: Fakulta informatiky
• Doi: http://dx.doi.org/10.1145/3330430.3333641
• Klíčová slova: problem difficulty; problem complexity; data collection bias; introductory programming; intelligent tutoring system
• Popis: Quantification of the difficulty of problem solving tasks has many applications in the development of adaptive learning systems, e.g., task sequencing, student modeling, and insight for content authors. There are, however, many potential conceptualizations and measures of problem difficulty and the computation of difficulty measures is influenced by biases in data collection. In this work, we explore difficulty measures for introductory programming tasks. The results provide insight into non-trivial behavior of even simple difficulty measures.

Související projekty

• Rozsáhlé výpočetní systémy: modely, aplikace a verifikace VIII.