Difficulty and Complexity of Introductory Programming Problems
Tomáš Effenberger, Jaroslav Čechák, Radek Pelánek · 2019
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.