Parsons problems and computing education learning theories

Parsons problems are code-ordering exercises where students create a correct program or algorithm by arranging a set of syntactically correct instructions into the correct sequence. The ordering allows novice programming students to focus on the program flow without being distracted by syntactical errors. By reducing cognitive load and promoting active engagement, Parsons Problems have been shown in many studies to support learning effectively. General learning theories such as cognitive load theory and constructivism have been used to underpin Parsons problems, and we first study the theoretical framing of Parsons problems with this lens. Despite Parsons problems originating within the computing domain, few computing education specific learning theories have been linked to Parsons problems. In this paper, we explore the depth of connections between computing specific theories of learning and Parsons problems as identified through a literature search. We found explicit and strong connections between Parsons problems and programming plans, notional machine and engagement taxonomy, with shallower connections with several other computing education theories.