Back to search

Georgia Institute of Technology

Evaluating the effectiveness and efficiency of Parsons problems and dynamically adaptive parsons problems as a type of low cognitive load practice problem

Abstract

dc:description.abstract

Learning to program can be difficult and time consuming. Learners can spend hours trying to figure out why their program doesn’t compile or run correctly. Many countries, including the United States, want to train thousands of secondary teachers to teach programming. However, busy in-service teachers do not have hours to waste on compiler errors or debugging. They need a more efficient way to learn. One way to reduce learning time is to use a completion task. Parsons problems are a type of code completion problem in which the learner must place blocks of correct, but mixed up, code in the correct order. Parsons problems can also have distractor blocks, which are not needed in a correct solution. Distractor blocks include common syntax errors like a missing colon on a for loop or semantic errors like the wrong condition on a loop. In this dissertation, I conducted three studies to compare the efficiency and effectiveness of solving Parsons problems, fixing code, and writing code. I also tested two forms of adaptation. For the second study, I added intra-problem adaptation, which dynamically makes the current problem easier. For the last study, I added inter-problem adaptation which makes the next problem easier or harder depending on the learner's performance. The studies provided evidence that students can complete Parsons problems significantly faster than fixing or writing code while achieving the same learning gains from pretest to posttest. The studies also provided evidence that adaptation helped more learners successfully solve Parsons problems. These studies were the first to empirically test the efficiency and effectiveness of solving Parsons problems versus fixing and writing code. They were also the first to explore the impact of both intra-problem and inter-problem adaptive Parsons problems. Finding a more efficient and just as effective form of practice could reduce the frustration that many novices feel when learning programming and help prepare thousands of secondary teachers to teach introductory computing courses.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Computer Science
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ericson, Barbara Jane
Advisor dc:contributor.advisor
  • Foley, James D.
Committee members dc:contributor.committeemember
  • Bruckman, Amy S.
  • Goel, Ashok K.
  • Catrambone, Richard
  • Kay, Alan C.
  • Resnick, Mitchel

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/59890

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ericson, Barbara Jane. Evaluating the effectiveness and efficiency of Parsons problems and dynamically adaptive parsons problems as a type of low cognitive load practice problem. Doctoral thesis, Georgia Institute of Technology, 2018. http://hdl.handle.net/1853/59890