Abstract:

Parsons Problems are an activity that requires students to understand code fragments and arrange those fragments in a suitable order to perform a well-defined task. Solving Parsons Problems acts to bridge the gap between code reading and code writing, as they constrain the problem-solving space while exposing students to syntax and common code structures and patterns. Many variations of Parsons Problems have been proposed, deployed and researched, and they have been shown to provide many of the same learning benefits as code writing but require less time. In this session we describe the early work and terminology relating to Parsons Problems, and highlight some of the influential work that has since emerged.

Bios:

Paul Denny

Paul Denny is an Associate Professor in the School of Computer Science at the University of Auckland. His research interests include developing and evaluating tools for supporting collaborative learning, understanding the ways that students engage with online learning environments, and exploring how recent advancements in AI may impact how and what we teach.

Andrew Luxton-Reilly

Andrew Luxton-Reilly is a Professor in the School of Computer Science at the University of Auckland. His research interests include peer learning, automated assessment tools, programming style, introductory programming, and the applications of AI for introductory programmers. He is an advocate for scholarship of teaching and learning, and disciplinary-based education research.

Beth Simon

Beth Simon is a Computer Science Education researcher with a focus on curriculum development for K-12. She is a Teaching Professor in the Education Studies Department at UC, San Diego. In addition to curriculum development work, she has an action research program supporting the adoption of evidence-based practices in university computing courses.