Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1550357,
author = {Effenberger, Tomáš and Čechák, Jaroslav and Pelánek, Radek},
booktitle = {3rd Educational Data Mining in Computer Science Education Workshop},
keywords = {complexity measure; difficulty measure; problem sequencing; introductory programming; Python; block-based programming; turtle graphics},
howpublished = {elektronická verze "online"},
language = {eng},
title = {Difficulty and Complexity of Introductory Programming Problems},
url = {https://sites.google.com/asu.edu/csedm-ws-aied-2019/home},
year = {2019}
}
TY - JOUR
ID - 1550357
AU - Effenberger, Tomáš - Čechák, Jaroslav - Pelánek, Radek
PY - 2019
TI - Difficulty and Complexity of Introductory Programming Problems
KW - complexity measure
KW - difficulty measure
KW - problem sequencing
KW - introductory programming
KW - Python
KW - block-based programming
KW - turtle graphics
UR - https://sites.google.com/asu.edu/csedm-ws-aied-2019/home
N2 - Difficulty and complexity measures are used for problem sequencing, authoring, and detecting problematic problems. We review measures of observed difficulty and intrinsic complexity for introductory programming exercises and explore the relationship between these measures using correlation analysis and projections onto a plane. Even though the exercises are similar, only a few trends hold for all of them, stressing the necessity for validating previous results about complexity and difficulty measures that were based on data from a single exercise.
ER -
EFFENBERGER, Tomáš, Jaroslav ČECHÁK a Radek PELÁNEK. Difficulty and Complexity of Introductory Programming Problems. Online. In \textit{3rd Educational Data Mining in Computer Science Education Workshop}. 2019, 8 s.
|
