Solving Parsons Problems Versus Fixing and Writing Code

被引:79
|
作者
Ericson, Barbara J. [1 ]
Margulieux, Lauren E. [2 ]
Rick, Jochen [1 ]
机构
[1] Georgia Inst Technol, Sch Interact Comp, Atlanta, GA 30332 USA
[2] Georgia State Univ, Learning Technol Div, Atlanta, GA 30303 USA
基金
美国国家科学基金会;
关键词
Parsons problems; Parsons programming puzzles; code-competition problems; cognitive load; assessment; PROGRAMMING INSTRUCTION; EXAMPLES; ACQUISITION; PERFORMANCE; COMPLETION; PRINCIPLES; STRATEGIES;
D O I
10.1145/3141880.3141895
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
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.
引用
收藏
页码:20 / 29
页数:10
相关论文
共 50 条
  • [1] Problem-Solving Efficiency and Cognitive Load for Adaptive Parsons Problems vs. Writing the Equivalent Code
    Haynes, Carl C.
    Ericson, Barbara J.
    CHI '21: PROCEEDINGS OF THE 2021 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, 2021,
  • [2] Evaluating the Performance of Code Generation Models for Solving Parsons Problems With Small Prompt Variations
    Reeves, Brent
    Sarsa, Sami
    Prather, James
    Denny, Paul
    Becker, Brett A.
    Hellas, Arto
    Kimmel, Bailey
    Powell, Garrett
    Leinonen, Juho
    PROCEEDINGS OF THE 2023 CONFERENCE ON INNOVATION AND TECHNOLOGY IN COMPUTER SCIENCE EDUCATION, ITICSE 2023, VOL 1, 2023, : 299 - 305
  • [3] Using Adaptive Parsons Problems to ScaffoldWrite-Code Problems
    Hou, Xinying
    Ericson, Barbara Jane
    Wang, Xu
    PROCEEDINGS OF THE 2022 ACM CONFERENCE ON INTERNATIONAL COMPUTING EDUCATION RESEARCH, ICER 2022, VOL. 1, 2023, : 15 - 26
  • [4] Generating Multi-Part Autogradable Faded Parsons Problems From Code-Writing Exercises
    Caraco, Serena
    Lojo, Nelson
    Verdicchio, Michael
    Fox, Armando
    PROCEEDINGS OF THE 55TH ACM TECHNICAL SYMPOSIUM ON COMPUTER SCIENCE EDUCATION, SIGCSE 2024, VOL. 1, 2024, : 179 - 185
  • [5] Solving Code-tracing Problems and its Effect on Code-writing Skills Pertaining to Program Semantics
    Kumar, Amruth N.
    ITICSE'15: PROCEEDINGS OF THE 2015 ACM CONFERENCE ON INNOVATION AND TECHNOLOGY IN COMPUTER SCIENCE EDUCATION, 2015, : 314 - 319
  • [6] SOLVING TOMMYS WRITING PROBLEMS
    BURDMAN, D
    ACADEMIC THERAPY, 1986, 22 (01): : 81 - 86
  • [7] Learning by Fixing: Solving Math Word Problems with Weak Supervision
    Hong, Yining
    Li, Qing
    Ciao, Daniel
    Haung, Siyuan
    Zhu, Song-Chun
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 4959 - 4967
  • [8] Solving initial value problems with a multiprocessor code
    Petcu, D
    PARALLEL COMPUTING TECHNOLOGIES, 1999, 1662 : 452 - 465
  • [9] Parsons Problems to Scaffold CodeWriting: Impact on Performance and Problem-Solving Efficiency
    Hou, Xinying
    Ericson, Barbara Jane
    Wang, Xu
    PROCEEDINGS OF THE 2023 CONFERENCE ON INNOVATION AND TECHNOLOGY IN COMPUTER SCIENCE EDUCATION, ITICSE 2023, VOL. 2, 2023, : 665 - 665
  • [10] Bug Fixing versus Code Reading: Which Is Better for Algorithm Learning?
    Kuramochi, Yuh
    Sakamoto, Kazunori
    Washizaki, Hironori
    Fukazawa, Yoshiaki
    IEEE TALE2021: IEEE INTERNATIONAL CONFERENCE ON ENGINEERING, TECHNOLOGY AND EDUCATION, 2021, : 218 - 225