Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/33383
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPierce, C-
dc.contributor.authorCain, A-
dc.contributor.authorBandara, L-
dc.contributor.authorPallant, N-
dc.date.accessioned2026-06-08T08:46:56Z-
dc.date.available2026-03-16-
dc.date.available2026-06-08T08:46:56Z-
dc.date.issued2026-03-16-
dc.identifier.citationProceedings of the 28th Australasian Computing Education Conference, 2026, pp. 95 - 101en_US
dc.identifier.issnhttp://dx.doi.org/10.1145/3786228.3786242-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/33383-
dc.description.abstractIntroductory programming (i.e., CS1) is a key subject in any computing degree, as students who do not succeed are significantly more likely to discontinue their studies. As such, maintaining motivation and engagement is critical to increasing student’s chance of success. In this paper we explore the potential for increasing introductory programming student’s motivation and engagement by offering multiple assessment options. These options are designed to cover the same concepts, and be of equivalent difficulty, but are themed differently. Our goal is to increase the likelihood that each student will find at least one option personally relatable and motivating. In order to achieve this, we also investigate methods for estimating the difficulty of a programming task based on an exemplar solution, so that we can ensure the assessment options are equivalent. We found that students reacted positively to being given assessment options, and that there were no negative impacts to student’s learning outcomes based on the assessment theme they chose. We also demonstrate the potential of several static code metrics in estimating the difficulty of introductory programming tasks.en_US
dc.format.extent95 - 101-
dc.language.isoenen_US
dc.publisherACMen_US
dc.sourceACE 2026: 28th Australasian Computing Education Conference-
dc.sourceACE 2026: 28th Australasian Computing Education Conference-
dc.subjectCS1en_US
dc.subjectIntroductory Programmingen_US
dc.subjectCS Educationen_US
dc.subjectEngagementen_US
dc.subjectAssessment Designen_US
dc.titleDesigning and Validating Multiple Assessment Options with Equivalent Difficulty for Introductory Programmingen_US
dc.identifier.doihttp://dx.doi.org/10.1145/3786228.3786242-
dc.relation.isPartOfProceedings of the 28th Australasian Computing Education Conference-
pubs.finish-date2026-02-13-
pubs.finish-date2026-02-13-
pubs.publication-statusPublished-
pubs.start-date2026-02-09-
pubs.start-date2026-02-09-
Appears in Collections:Department of Mathematics Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf1.78 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.