Measuring Difficulty of Introductory Programming Tasks

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

EFFENBERGER Tomáš ČECHÁK Jaroslav PELÁNEK Radek

Year of publication 2019
Type Article in Proceedings
Conference Proceedings of the Sixth (2019) ACM Conference on Learning @ Scale (L@S '19)
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1145/3330430.3333641
Keywords problem difficulty; problem complexity; data collection bias; introductory programming; intelligent tutoring system
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info