First year students’ understanding of the flow of control in recursive algorithms

Abstract

Recursion is an important concept for any computer science student to master. Many first year students develop the viable copies mental model of recursion and can successfully trace the execution of a simple recursive function. This article discusses a study focused on deter-mining whether the ability to successfully trace a recursive function means that the student understands recursion or whether they are simply “applying a formula”. The research question investigated was thus “To what extent do students with viable trace mental models un-derstand the flow of control of recursive algorithms?” The research followed a phenomeno-logical approach. A group of first year students with viable mental models was identified by classifying the mental models in their answers to test questions. Fifteen of these students were interviewed. The interviews involved the students talking aloud while they tackled vari-ous tasks. Each student’s understanding of the active flow, the limiting case and the passive flow was assessed. The results show that in most cases even these students have some diffi-culty with the active flow, are confused about the passive flow and have misconceptions about the limiting case. This implies that more careful thought needs to be given to the exam-ples used in teaching recursion and how the concept is taught.