Pair Programming and the Level of Knowledge in the Formation of Pairs

Date

2021

Embargo

Advisor

Coadvisor

Journal Title

Journal ISSN

Volume Title

Publisher

Springer
Language
English

Research Projects

Organizational Units

Journal Issue

Alternative Title

Abstract

The pandemic situation COVID-19 requires teachers to rethink some of the activities proposed to students since even though they are physically in the same room at the university, they cannot join and must maintain a social distance. The curricular unit of introduction to programming in the first year of computer courses requires several activities: students only learn by doing. One of the activities that has been used a lot in the academic community is pair programming: a single computer for two students working together. In the case that this article reports the pair works sharing a ZOOM room and alternates the position of driver (writes the code) with navigator (one that comments on the code). This article uses the technique of pair programming for writing top-down, algorithm and traces to verify the behavior of variables along the algorithm. If the pair programming technique has had very interesting results in terms of task speed and code quality far superior to programmers alone, there are some doubts about the problem of the constitution pf the groups. In this article we use two opposite strategies: group students with opposite knowledge or group students with similar knowledge. We found that students who prefer this activity are the worst ones (in both strategies) and the best students when grouped with colleagues with similar knowledge.

Keywords

Pair programming, COVID-19, CS1, Work group, Algorithms

Document Type

conferenceObject

Dataset

Citation

Sobral S.R. (2021). Pair Programming and the Level of Knowledge in the Formation of Pairs. In: Á. Rocha, H. Adeli, G. Dzemyda, F. Moreira, A. M. Ramalho Correia (eds.), Trends and Applications in Information Systems and Technologies. WorldCIST 2021, Advances in Intelligent Systems and Computing, vol. 1367, pp. 212-221. Springer, Cham. doi: https://doi.org/10.1007/978-3-030-72660-7_21. Disponível no Repositório UPT, http://hdl.handle.net/11328/3405

Identifiers

TID

Designation

Access Type

Open Access

Sponsorship

Description