Proceedings of the 2016 ACM Conference on Innovation and Technology in Computer Science Education 2016
DOI: 10.1145/2899415.2899473
|View full text |Cite
|
Sign up to set email alerts
|

Benchmarking Introductory Programming Exams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…Detailed analyses of written exam papers from institutions in a number of countries explore the types of question used [608], the difficulty of the questions [610], and their complexity [595]. Questions suitable for benchmarking have been proposed and trialled in exams in multiple institutions by Sheard, Simon, and colleagues [597,612,613]. Another analysis of exam papers from multiple institutions by Petersen et al [506] finds that most questions focus on code writing and involve multiple concepts, making them challenging for novices.…”
Section: Assessment Analysismentioning
confidence: 99%
“…Detailed analyses of written exam papers from institutions in a number of countries explore the types of question used [608], the difficulty of the questions [610], and their complexity [595]. Questions suitable for benchmarking have been proposed and trialled in exams in multiple institutions by Sheard, Simon, and colleagues [597,612,613]. Another analysis of exam papers from multiple institutions by Petersen et al [506] finds that most questions focus on code writing and involve multiple concepts, making them challenging for novices.…”
Section: Assessment Analysismentioning
confidence: 99%
“…It is clear to us that there is no single correct decomposition for a given question; indeed, the members of our expert group did not always agree on how a certain concept should be decomposed. For example, in question 6 from the benchmarking paper [75], the statement i n t [ ] nums1 = { 1 , −5 , 2 , 0 , 4 , 2 , −3 } ; led to disagreement on whether the concept of references is necessary as a token. A discussion revealed the idea that the granularity of decomposition is context-dependent, and that the concept of references is not needed in the decomposition of this particular code in the context of this particular question.…”
Section: Case Study Summarymentioning
confidence: 99%
“…The students scored very poorly -22.89 out of 110 possible points on average. As a result, the paper has been widely cited since its publication in 2001 for the proposition that students cannot write code (see, e.g., [24,29,38,75]).…”
Section: Introductionmentioning
confidence: 99%