The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Failure rates in introductory programming
Abstract
It is a common conception that CS1 is a very difficult course and that failure rates are high. However, until now there has only been anecdotal evidence for this claim. This article reports on a survey among institutions around the world regarding failure rates in introductory programming courses. The article describes the design of the survey and the results. The number of institutions answering the call for data was unfortunately rather low, so it is difficult to make firm conclusions. It is our hope that this article can be the starting point for a systematic collection of data in order to find solid proof of the actual failure and pass rates of CS1.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning and Teaching Programming: A Review and Discussion
Robins, A., Rountree, J., & Rountree, N. (2003) · Computer Science Education · doi:10.1076/csed.13.2.137.14200 · Cited by 1,736 · cited 1×
“It is generally accepted that it is very difficult to learn to programming [7, 11, 14].”
BackgroundComputing Curricula 2001: Computer Science
Acm Ieee-Cs Joint Curriculum Task Force (2002) · Cited by 279
The influence of motivation and comfort-level on learning to program
Bergin, S., & Reilly, R. B. (2005) · Maynooth University ePrints and eTheses Archive (Maynooth University) · Cited by 146
Design process for a non-majors computing course
Guzdial, M., & Forte, A. (2005) · ACM SIGCSE Bulletin · doi:10.1145/1047124.1047468 · Cited by 133
Controversy on how to teach CS 1: a discussion on the SIGCSE-members mailing list
Bruce, K. B. (2004) · ACM SIGCSE Bulletin · doi:10.1145/1041624.1041652 · Cited by 122
Program quality with pair programming in CS1
Hanks, B., McDowell, C., Draper, D., & Krnjajić, M. (2004) · ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE) · doi:10.1145/1007996.1008043 · Cited by 119
Design process for a non-majors computing course
Guzdial, M., & Forte, A. (2005) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/1047344.1047468 · Cited by 65
Controversy on how to teach CS 1
Bruce, K. B. (2005) · ACM SIGCSE Bulletin · doi:10.1145/1083431.1083477 · Cited by 59
Cited by
Failure rates in introductory programming revisited
Watson, C., & Li, F. W. B. (2014) · Proceedings of the 2014 conference on Innovation & technology in computer science education - ITiCSE '14 · doi:10.1145/2591708.2591749 · Cited by 639
Introductory programming: a systematic literature review
Luxton-Reilly, A., Simon, Albluwi, I., Becker, B. A., Giannakos, M., Kumar, A. N., Ott, L., Paterson, J., Scott, M. J., Sheard, J., et al. (2018) · Proceedings Companion of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education · doi:10.1145/3293881.3295779 · Cited by 485
Costa, E. B., Fonseca, B., Santana, M. A., de Araújo, F. F., & Rego, J. (2017) · Computers in Human Behavior · doi:10.1016/j.chb.2017.01.047 · Cited by 418
A Systematic Literature Review on Teaching and Learning Introductory Programming in Higher Education
Medeiros, R. P., Ramalho, G. L., & Falcao, T. P. (2019) · IEEE Transactions on Education · doi:10.1109/te.2018.2864133 · Cited by 384
A systematic literature review of automated feedback generation for programming exercises
Keuning, H., Jeuring, J., & Heeren, B. (2019) · ACM Transactions on Computing Education · doi:10.1145/3231711 · Cited by 370
“• learning programming is challenging [125], and students need help to make progress [29]; • programming courses are taken by thousands of students all over the world [20], and helping students individually with their problems requires a huge time investment of teachers [133].”
Background
Metadata
- Authors
- Bennedsen, J., & Caspersen, M. E.
- Venue
- ACM SIGCSE Bulletin
- Published
- 2007-06
- Volume
- 39
- Issue
- 2
- Pages
- 32-36
- ISSN
- 0097-8418 (ISSN-L)
- OpenAlex
- W2067963826
- Cited by
- 627
- References
- 8
- FWCI
- 18.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.