Difficulty and Complexity of Introductory Programming Problems

Warning

This publication doesn't include Faculty of Arts. 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 3rd Educational Data Mining in Computer Science Education Workshop
MU Faculty or unit

Faculty of Informatics

Citation
Web webové stránky workshopu
Keywords complexity measure; difficulty measure; problem sequencing; introductory programming; Python; block-based programming; turtle graphics
Description 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.
Related projects:

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