EFFENBERGER, Tomáš, Jaroslav ČECHÁK and Radek PELÁNEK. Difficulty and Complexity of Introductory Programming Problems. Online. In 3rd Educational Data Mining in Computer Science Education Workshop. 2019, 8 pp.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Difficulty and Complexity of Introductory Programming Problems
Authors EFFENBERGER, Tomáš, Jaroslav ČECHÁK and Radek PELÁNEK.
Edition 3rd Educational Data Mining in Computer Science Education Workshop, 8 pp. 2019.
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW webové stránky workshopu
Organization unit Faculty of Informatics
Keywords in English complexity measure; difficulty measure; problem sequencing; introductory programming; Python; block-based programming; turtle graphics
Tags International impact, Reviewed
Changed by Changed by: RNDr. Jaroslav Čechák, Ph.D., učo 410322. Changed: 27/8/2019 07:59.
Abstract
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.
Links
MUNI/A/1018/2018, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace VIII.
Investor: Masaryk University, Category A
PrintDisplayed: 11/10/2024 14:25