Copyright © 2006 Elsevier B.V. All rights reserved.
A preliminary study on the impact of a pair design phase on pair programming and solo programming
Received 26 August 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The drawback of pair programming is the nearly doubled personnel cost. The extra cost of pair programming originates from the strict rule of extreme programming where every line of code should be developed by a pair of developers. Is this rule not a waste of resources? Is it not possible to gain a large portion of the benefits of pair programming by only a small fraction of the meeting time of a pair programming session? We conducted a preliminary study to answer this question by splitting the pair programming process into a pair design and a pair implementation phase. The pair implementation phase is compared to a solo implementation phase, which in turn was preceeded by a pair design phase, as well. The study is preliminary as its major goal was to identify an appropriate sample size for subsequent experiments. The data from this study suggest that there is no difference in terms of development cost between a pair and a solo implementation phase if the cost for developing programs of similar level of correctness is concerned.
Keywords: Pair programming; Preliminary study; Post-development test-cases
Article Outline
- 1. Introduction
- 2. The study
- 2.1. Participants
- 2.2. Experiment task
- 2.3. Experiment plan
- 2.4. Calculation of group sizes
- 2.5. Division of subjects into groups and pairs
- 2.6. Acceptance-test
- 2.7. Gathered data
- 2.8. Construct validity of cost measure
- 2.9. Internal threats
- 2.10. External threats
- 3. Results
- 3.1. Cost of design phase
- 3.2. Comparison of cost
- 3.3. Comparison of failures
- 3.4. Sample size calculation
- 4. Conclusions
- Acknowledgements
- Appendix A. Appendix data sets
- References







E-mail Article
Add to my Quick Links

Cited By in Scopus (3)





