Difficulty and Complexity of Introductory Programming Problems

Varování

Publikace nespadá pod Filozofickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

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

Rok publikování 2019
Druh Článek ve sborníku
Konference 3rd Educational Data Mining in Computer Science Education Workshop
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www webové stránky workshopu
Klíčová slova complexity measure; difficulty measure; problem sequencing; introductory programming; Python; block-based programming; turtle graphics
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.