Cited by 58Teaching and Learning ProgrammingSoftware Engineering ResearchArtificial Intelligence in Education

Evaluating the Performance of Code Generation Models for Solving Parsons Problems With Small Prompt Variations

Open access
Reeves, Brent, Sarsa, Sami, Prather, James, Denny, Paul, Becker, Brett A., Hellas, Arto, Kimmel, Bailey, Powell, Garrett +1 more·2023·Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 1

Abstract

The recent emergence of code generation tools powered by large language models has attracted wide attention. Models such as OpenAI Codex can take natural language problem descriptions as input and generate highly accurate source code solutions, with potentially significant implications for computing education. Given the many complexities that students face when learning to write code, they may quickly become reliant on such tools without properly understanding the underlying concepts. One popular approach for scaffolding the code writing process is to use Parsons problems, which present solution lines of code in a scrambled order. These remove the complexities of low-level syntax, and allow students to focus on algorithmic and design-level problem solving. It is unclear how well code generation models can be applied to solve Parsons problems, given the mechanics of these models and prior evidence that they underperform when problems include specific restrictions. In this paper, we explore the performance of the Codex model for solving Parsons problems over various prompt variations. Using a corpus of Parsons problems we sourced from the computing education literature, we find that Codex successfully reorders the problem blocks about half of the time, a much lower rate of success when compared to prior work on more free-form programming tasks. Regarding prompts, we find that small variations in prompting have a noticeable effect on model performance, although the effect is not as pronounced as between different problems.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3587102.3588805

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The 'many small programs' approach may have become obsolete given how easily most LLMs can now solve introductory computing problems with simple prompts.

    “However, this approach may have become obsolete given how easily most LLMs can now solve introductory computing problems with simple prompts [85,86,167,175].”
  • For other tasks, such as answering multiple-choice questions, Parsons problems, and computational thinking tasks, the performance of LLMs is currently not as great.

    “For other tasks, such as answering MCQs [176], Parsons problems [167] and computational thinking tasks [39], the performance of LLMs is currently not as great.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. Barbara J. Ericson, Mark J. Guzdial, and Briana B. Morrison. 2015. Analysis of Interactive Features Designed to Enhance Learning in an Ebook. In Proc. of the 11th Annual Int. Conf. on Int. Computing Education Research. ACM, 169-178.
  2. Dale Parsons and Patricia Haden. 2006. Parson's Programming Puzzles: A Fun and Effective Learning Tool for First Programming Courses. In Proc. of the 8th Australasian Conf. on Computing Education -Volume 52 (ACE '06). Australian Computer Society, Inc., AUS, 157-163.
  3. James Prather, John Homer, Paul Denny, Brett Becker, John Marsden, et al. 2022. Scaffolding Task Planning Using Abstract Parsons Problems. In Proc. of the 2022 World Conf. on Computers in Education (WCCE '22). 1-10.
  4. Priyan Vaithilingam, Tianyi Zhang, and Elena L. Glassman. 2022. Expectation vs. Experience: Evaluating the Usability of Code Generation Tools Powered by Large Language Models. In CHI Conf. on Human Factors in Computing Systems Extended Abstracts. ACM, NY NY, USA, 1-7.
  5. Rui Zhi, Min Chi, Tiffany Barnes, and Thomas W. Price. 2019. Evaluating the Effectiveness of Parsons Problems for Block-Based Programming. In Proc. of the 2019 ACM Conf. on Int. Computing Education Research. ACM, NY, NY, USA, 51-59.

Cited by

Sorted by citations

Authors
Reeves, B., Sarsa, S., Prather, J., Denny, P., Becker, B. A., Hellas, A., Kimmel, B., Powell, G., & Leinonen, J.
Affiliations
  • Abilene Christian University (US)
  • Aalto University (FI)
  • University of Auckland (NZ)
  • University College Dublin (IE)
Venue
Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 1
Publisher
ACM
Published
2023-06-29
Pages
299-305
OpenAlex
W4382652775
Cited by
56
References
37
Citations by year
2026: 3 · 2025: 19 · 2024: 26 · 2023: 8
FWCI
16.92
Type
conference paper
Language
en
Open access
Locations
  • ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE) (publishedVersion, cc-by)
  • Aaltodoc (Aalto University) (submittedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Physical Sciences › Computer Science › Information Systems › Artificial Intelligence in Education
Keywords
Parsons problems, code generation, large language models, OpenAI Codex, prompt variation, programming education, prompt engineering

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review