Some empirical results for neo-Piagetian reasoning in novice programmers and the relationship to code explanation questions

  • Authors:

  • Malcolm Corney;Donna Teague;Alireza Ahadi;Raymond Lister

  • Affiliations:

  • Queensland University of Technology, Brisbane, QLD, Australia;Queensland University of Technology, Brisbane, QLD, Australia;University of Technology, Sydney, Sydney, NSW, Australia;University of Technology, Sydney, Sydney, NSW, Australia

  • Venue:
  • ACE '12 Proceedings of the Fourteenth Australasian Computing Education Conference - Volume 123
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent research on novice programmers has suggested that they pass through neo-Piagetian stages: sensorimotor, preoperational, and concrete operational stages, before eventually reaching programming competence at the formal operational stage. This paper presents empirical results in support of this neo-Piagetian perspective. The major novel contributions of this paper are empirical results for some exam questions aimed at testing novices for the concrete operational abilities to reason with quantities that are conserved, processes that are reversible, and properties that hold under transitive inference. While the questions we used had been proposed earlier by Lister, he did not present any data for how students performed on these questions. Our empirical results demonstrate that many students struggle to answer these problems, despite the apparent simplicity of these problems. We then compare student performance on these questions with their performance on six explain in plain English questions.