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 条
  • [41] POPULATION VERSUS LIBERTY - PARSONS,J
    不详
    POPULATION, 1974, 29 (4-5): : 939 - 939
  • [42] Fixing Science's Code Problem
    Zimmer, Katarina
    SCIENTIST, 2022, 36 (03): : 74 - 76
  • [43] A Personalized Code Formatter: Detection and Fixing
    Karanikiotis, Thomas
    Chatzidimitriou, Kyriakos C.
    Symeonidis, Andreas L.
    SOFTWARE TECHNOLOGIES, ICSOFT 2021, 2022, 1622 : 169 - 192
  • [44] Evaluating Copilot on CS1 Code Writing Problems with Suppressed Specifications
    Venkatesh, Varshini
    Venkatesh, Vaishnavi
    Kumar, Viraj
    PROCEEDINGS OF THE 16TH ANNUAL ACM INDIA COMPUTE CONFERENCE, COMPUTE 2023, 2023, : 104 - 107
  • [45] IMPORTANCE OF STUDIES OF SYNTHETIC POLY- AND OLIGONUCLEOTIDES IN SOLVING GENETIC CODE PROBLEMS
    LISY, V
    CHEMICKE LISTY, 1969, 63 (01): : 89 - &
  • [46] Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over Fq
    Beullens, Ward
    SELECTED AREAS IN CRYPTOGRAPHY, 2021, 12804 : 387 - 403
  • [47] SOLVING URBAN LOCATION PROBLEMS - HUMAN INTUITION VERSUS COMPUTER
    SCHNEIDER, JB
    JOURNAL OF THE AMERICAN INSTITUTE OF PLANNERS, 1971, 37 (02): : 95 - 99
  • [48] NumCalc: An open-source BEM code for solving acoustic scattering problems
    Kreuzer, Wolfgang
    Pollack, Katharina
    Brinkmann, Fabian
    Majdak, Piotr
    ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS, 2024, 161 (157-178) : 157 - 178
  • [49] Solving Minimax Problems: Local Smoothing Versus Global Smoothing
    Bagirov, A. M.
    Sultanova, N.
    Al Nuaimat, A.
    Taheri, S.
    NUMERICAL ANALYSIS AND OPTIMIZATION, 2018, 235 : 23 - 43
  • [50] Structured collaboration versus individual learning in solving physics problems
    Harskamp, Egbert
    Ding, Ning
    INTERNATIONAL JOURNAL OF SCIENCE EDUCATION, 2006, 28 (14) : 1669 - 1688