Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.

Solving parsons problems versus fixing and writing code

Ericson, Barbara J., Margulieux, Lauren E., Rick, Jochen · 2017 · Proceedings of the 17th Koli Calling International Conference on Computing Education Research

Abstract

Prior research has shown that Parsons problems are an engaging type of code completion problem that can be used to teach syntactic and semantic language constructs. They can also be used in summative assessments to reduce marking time and grading variability compared to code writing problems. In a Parsons problem the correct code is provided, but is broken into mixed-up code blocks that must be assembled in the correct order. Two-dimensional Parsons problems also require the code blocks to be indented correctly. Parsons problems can contain extra code blocks, called distractors, which are not needed in a correct solution. We present a study that compared the efficiency, effectiveness, and cognitive load of learning from solving two-dimensional Parsons problems with distractors, versus fixing code with the same errors as the distractors, versus writing the equivalent code. We found that solving two-dimensional Parsons problems with distractors took significantly less time than fixing code with errors or than writing the equivalent code. Additionally, there was no statistically significant difference in the learning performance, or in student retention of the knowledge one week later.

Overview

Integrity signals

Registry

Crossref · 10.1145/3141880.3141895

Cites

56 of 56 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 56 references

Research works printed but not linked: 7

  1. 10.3102/00346543070002181 · doi:10.3102/00346543070002181 · Paper page
  2. John D. Bransford , Ann L. Brown and Rodney R . Cocking How People Learn. NATIONAL ACADEMY PRESS , 2000 . John D. Bransford, Ann L. Brown and Rodney R. Cocking How People Learn. NATIONAL ACADEMY PRESS, 2000.
  3. 10.1037/0096-3445.127.4.355 · doi:10.1037/0096-3445.127.4.355 · Paper page
  4. Barbara Ericson Java Review Book for the AP CS A exam https://runestone.academy/runestone/static/JavaReview/index.html Barbara Ericson Java Review Book for the AP CS A exam https://runestone.academy/runestone/static/JavaReview/index.html
  5. 10.1207/s15516709cog1202_4 · doi:10.1207/s15516709cog1202_4 · Paper page
  6. William MK Trochim and James P Donnelly Research methods knowledge base ( 3 rd ed). Atomic Dog , Cincinnati, OH , 2006 . William MK Trochim and James P Donnelly Research methods knowledge base (3rd ed). Atomic Dog, Cincinnati, OH, 2006.
  7. Barry J. Wadsworth Piaget's Theory of Cognitive and Affective Development - Fourth Edition. Longman , New York 1989 . Barry J. Wadsworth Piaget's Theory of Cognitive and Affective Development - Fourth Edition. Longman, New York 1989.

Cited by

See all 121

Metadata

Authors
Ericson, B. J., Margulieux, L. E., & Rick, J.
Affiliations
  • Georgia Institute of Technology (US)
  • Georgia State University (US)
Venue
Proceedings of the 17th Koli Calling International Conference on Computing Education Research
Publisher
ACM
Published
2017-11-16
Pages
20-29
OpenAlex
W2766230222
Cited by
121
References
56
Citations by year
2026: 6 · 2025: 9 · 2024: 13 · 2023: 21 · 2022: 18 · 2021: 19 · 2020: 18 · 2019: 14 · 2018: 3
FWCI
8.82
Type
conference paper
Language
en
Open access
closed
Locations
Koli Calling International Conference on Computing Education Research (publishedVersion)
Funders
National Science Foundation (1432300 and 1138378)
Topics
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
  • Social Sciences › Education › Educational Robotics and Engineering
  • Social Sciences › Psychology › Experimental and Cognitive Psychology › Visual and Cognitive Learning Processes
Keywords
Parsons problems, distractors, code completion, writing software, programming education, cognitive load, learning efficiency, knowledge retention, summative assessment

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Solving parsons problems versus fixing and writing code. https://app.cochat.ai/papers/10.1145/3141880.3141895
The paper
Ericson, B. J., Margulieux, L. E., & Rick, J. (2017). Solving parsons problems versus fixing and writing code. Proceedings of the 17th Koli Calling International Conference on Computing Education Research. https://doi.org/10.1145/3141880.3141895

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.