Detailed Information on Publication Record
2019
Measuring Difficulty of Introductory Programming Tasks
EFFENBERGER, Tomáš, Jaroslav ČECHÁK and Radek PELÁNEKBasic information
Original name
Measuring Difficulty of Introductory Programming Tasks
Authors
EFFENBERGER, Tomáš (203 Czech Republic, guarantor, belonging to the institution), Jaroslav ČECHÁK (203 Czech Republic, belonging to the institution) and Radek PELÁNEK (203 Czech Republic, belonging to the institution)
Edition
New York, Proceedings of the Sixth (2019) ACM Conference on Learning @ Scale (L@S '19), p. „28:1“-„28:4“, 4 pp. 2019
Publisher
ACM
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
United States of America
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
electronic version available online
RIV identification code
RIV/00216224:14330/19:00110491
Organization unit
Faculty of Informatics
ISBN
978-1-4503-6804-9
UT WoS
000507611000028
Keywords in English
problem difficulty; problem complexity; data collection bias; introductory programming; intelligent tutoring system
Tags
International impact, Reviewed
Změněno: 10/6/2022 23:18, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
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.
Links
| MUNI/A/1018/2018, interní kód MU |
|