Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1550356, author = {Effenberger, Tomáš and Čechák, Jaroslav and Pelánek, Radek}, address = {New York}, booktitle = {Proceedings of the Sixth (2019) ACM Conference on Learning @ Scale (L@S '19)}, doi = {http://dx.doi.org/10.1145/3330430.3333641}, keywords = {problem difficulty; problem complexity; data collection bias; introductory programming; intelligent tutoring system}, howpublished = {elektronická verze "online"}, language = {eng}, location = {New York}, isbn = {978-1-4503-6804-9}, pages = {„28:1“-„28:4“}, publisher = {ACM}, title = {Measuring Difficulty of Introductory Programming Tasks}, year = {2019} }
TY - JOUR ID - 1550356 AU - Effenberger, Tomáš - Čechák, Jaroslav - Pelánek, Radek PY - 2019 TI - Measuring Difficulty of Introductory Programming Tasks PB - ACM CY - New York SN - 9781450368049 KW - problem difficulty KW - problem complexity KW - data collection bias KW - introductory programming KW - intelligent tutoring system N2 - 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. ER -
EFFENBERGER, Tomáš, Jaroslav ČECHÁK and Radek PELÁNEK. Measuring Difficulty of Introductory Programming Tasks. Online. In \textit{Proceedings of the Sixth (2019) ACM Conference on Learning @ Scale (L@S '19)}. New York: ACM, 2019, p.~„28:1“-„28:4“, 4 pp. ISBN~978-1-4503-6804-9. Available from: https://dx.doi.org/10.1145/3330430.3333641.
|