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 条
  • [11] Declaratively Solving Google Code Jam Problems with Picat
    Dymchenko, Sergii
    Mykhailova, Mariia
    PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, PADL 2015, 2015, 9131 : 50 - 57
  • [12] Combined Approach to Solving Problems in Binary Code Analysis
    Getman, Alexander
    Padaryan, Vartan
    Solovyev, Mikhail
    2013 COMPUTER SCIENCE AND INFORMATION TECHNOLOGIES (CSIT), 2013,
  • [13] PARSONS SYSTEM PROBLEMS
    LESSNOFF, MH
    SOCIOLOGICAL REVIEW, 1968, 16 (02): : 185 - 215
  • [14] Bug-fixing and code-writing:: The private provision of open source software
    Bitzer, J
    Schröder, PJH
    INFORMATION ECONOMICS AND POLICY, 2005, 17 (03) : 389 - 406
  • [15] Epplets: A Tool for Solving Parsons Puzzles
    Kumar, Amruth N.
    SIGCSE'18: PROCEEDINGS OF THE 49TH ACM TECHNICAL SYMPOSIUM ON COMPUTER SCIENCE EDUCATION, 2018, : 527 - 532
  • [16] WRITING IN THE REAL CLASSROOM - PARSONS,L
    KUHRT, B
    JOURNAL OF READING, 1991, 35 (03): : 267 - 269
  • [17] Web site accessibility: Identifying and fixing accessibility problems in client page code
    Di Lucca, GA
    Fasolino, AR
    Tramontana, P
    WSE 2005: SEVENTH IEEE INTERNATIONAL SYMPOSIUM ON WEB SITE EVOLUTION, PROCEEDINGS, 2005, : 71 - 78
  • [19] Dynamically Adaptive Parsons Problems
    Ericson, Barbara J.
    PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INTERNATIONAL COMPUTING EDUCATION RESEARCH (ICER'16), 2016, : 269 - 270
  • [20] PARSONS PROBLEMS: A LITERATURE REVIEW
    Smith, Julie M.
    12TH INTERNATIONAL CONFERENCE OF EDUCATION, RESEARCH AND INNOVATION (ICERI2019), 2019, : 7773 - 7778