The effects of "pair-pressure" and "pair-learning" on software engineering education
The DOI matches its Crossref record.
Abstract
Anecdotal evidence from several sources, primarily in industry, indicates that two programmers working collaboratively on the same design, algorithm, code, or test perform substantially better than the two would working alone. In this technique, often called "pair programming" or "collaborative programming", one person is the "driver" and has control of the pencil/mouse/keyboard and is writing the design or code. The other person continuously and actively observes the work of the driver-watching for defects, thinking of alternatives, looking up resources, and considering strategic implications of the work at hand. A course in Web programming was taught at the University of Utah in Summer Semester 1999. In this course, the students worked in pairs, continuously collaborating on all programming assignments. Using the technique, the students applied a positive form of "pair-pressure" on each other, which proved beneficial to the quality of their work products. The students also benefited from "pair-learning", which allowed them to learn new languages faster and better than they had experienced with solitary learning. "Pair-learning" also reduced the workload of the teaching because the students no longer relied primarily on them for technical support and advise.
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
Cited by
Conboy, K. (2009) · Information Systems Research · doi:10.1287/isre.1090.0236 · Cited by 823
Pair programming improves student retention, confidence, and program quality
McDowell, C., Werner, L., Bullock, H. E., & Fernald, J. (2006) · Communications of the ACM · doi:10.1145/1145287.1145293 · Cited by 418
Salleh, N., Mendes, E., & Grundy, J. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.59 · Cited by 356
The effects of pair-programming on performance in an introductory programming course
McDowell, C., Werner, L., Bullock, H., & Fernald, J. (2002) · Proceedings of the 33rd SIGCSE technical symposium on Computer science education · doi:10.1145/563340.563353 · Cited by 352
In Support of Pair Programming in the Introductory Computer Science Course
Williams, L., Wiebe, E., Yang, K., Ferzli, M., & Miller, C. (2002) · Computer Science Education · doi:10.1076/csed.12.3.197.8618 · Cited by 270
Self-citationThe impact of pair programming on student performance, perception and persistence
McDowell, C., Werner, L., Bullock, H. E., & Fernald, J. L. (2003) · doi:10.5555/776816.776899 · Cited by 211
Are Reviews an Alternative to Pair Programming?
Müller, M. M. (2004) · Empirical Software Engineering · doi:10.1023/b:emse.0000039883.47173.39 · Cited by 61
“Williams studied pair programming with 41 undergraduate students (Williams and Kessler, 2000).”
BackgroundInfluentialKuttal, S. K., Ong, B., Kwasny, K., & Robe, P. (2021) · Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3411764.3445659 · Cited by 44
Kuttal, S. K., Myers, J., Gurka, S., Magar, D., Piorkowski, D., & Bellamy, R. (2020) · 2020 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC) · doi:10.1109/vl/hcc50065.2020.9127276 · Cited by 27
“[20], and dependencies on peers’ programming abilities [21].”
Background
Metadata
- Authors
- Williams, L. A., & Kessler, R. R.
- Venue
- Thirteenth Conference on Software Engineering Education and Training
- Publisher
- IEEE Comput. Soc
- Published
- 2005-08-24
- Pages
- 59-65
- OpenAlex
- W2164355693
- Cited by
- 111
- References
- 0
- FWCI
- 10.12
- Type
- conference paper
- 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.