When does a pair outperform two individuals?

  • Authors:
  • Kim Man Lui;Keith C. C. Chan

  • Affiliations:
  • Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Hong Kong;Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Hong Kong

  • Venue:
  • XP'03 Proceedings of the 4th international conference on Extreme programming and agile processes in software engineering
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.