Please use this identifier to cite or link to this item:
Title: When does a pair outperform two individuals
Authors: Lui, K
Chan, KCC 
Issue Date: 2003
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2003, v. 2675, p. 225-233 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: This paper reports experimental measurements of productivity and quality in pair programming. The work complements Laurie Williams’ work on collaborative programming, in which Pair Programming and Solo Programming student groups wrote the same programs and then their activities were measured to investigate productivity, quality, etc. In this paper, Pair and Solo industrial programmer groups are requested to complete algorithm-style aptitude tests so as to observe the capability of solving algorithms in singles and in pairs. So doing is independent of the familiarity of a programming language. Besides, we also take another approach to examining pair programming. A single group of industrial programmers carries alternately out Pair Programming and Solo Programming. All these demonstrate that productivity in pair programming hinges upon algorithm design at all levels from understanding problems and implementing solutions. In addition, we reach similar conclusions to Williams. Our findings indicate that simple design, refactoring, and rapid feedback provide an excellent continuous-design environment for higher productivity in pair programming.
Description: 4th International Conference on Extreme Programming and Agile Processes in Software Engineering (XP 2003), Genova, Italy, May 2003
ISBN: 978-3-540-40215-2
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/3-540-44870-5_28
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Citations as of Mar 19, 2018

Google ScholarTM



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