Epplets: A Tool for Solving Parsons Puzzles

被引:27
|
作者
Kumar, Amruth N. [1 ]
机构
[1] Ramapo Coll, Mahwah, NJ 07430 USA
基金
美国国家科学基金会;
关键词
D O I
10.1145/3159450.3159576
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Performance on Parsons puzzles has been found to correlate with that on code-writing exercises. Parsons puzzles are preferred by students over alternative programming tasks. In order to make Parsons puzzles widely available to students in the introductory programming course, we developed a tool that administers the puzzles in C++, Java and C, called epplets. Our design of the tool improves upon the work done by earlier researchers in several ways: students rearrange lines of code rather than program fragments; they get credit based on the number of actions they take to reassemble the code; they get feedback that helps them fix their incorrect answer; and the tool adapts to the needs of the student. The tool runs as a Java Web application. We describe our experience using the tool for two years: how it benefited the students; the revisions made to address the feedback provided by the users; and our plans for future work. We found that practicing with the tool helped reduce the time and actions with which students solved successive puzzles.
引用
收藏
页码:527 / 532
页数:6
相关论文
共 50 条
  • [41] Subgoal Strategies for Solving Board Puzzles
    Guoxiang Huang
    Dale Myers
    Journal of Automated Reasoning, 1998, 20 : 215 - 253
  • [42] Solving Towers of Hanoi and Related Puzzles
    Cull, Paul
    Merrill, Leanne
    Van, Tony
    Burkhardt, Celeste
    Pitts, Tommy
    COMPUTER AIDED SYSTEMS THEORY, PT 1, 2013, 8111 : 12 - 19
  • [43] Solving puzzles related to permutation groups
    Egner, Sebastian
    Pueschel, Markus
    Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, : 186 - 193
  • [44] Genetic Algorithm Cleaning in Sequential Data Mining: Analyzing Solutions to Parsons' Puzzles
    Tan, Kok Cheng
    Zantedeschi, Daniel
    Kumar, Amruth
    Gaspar, Alessio
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2022, 2022, : 2330 - 2333
  • [45] An analysis of Harmony Search for solving Sudoku puzzles
    Chae, Rachel H.
    Regan, Amelia C.
    Soft Computing Letters, 2021, 3
  • [46] Enumeration Strategies in Constraint Programming for solving puzzles
    Crawford, Broderick
    Aranda, Mary
    Castro, Carlos
    Monfroy, Eric
    CERMA 2007: ELECTRONICS, ROBOTICS AND AUTOMOTIVE MECHANICS CONFERENCE, PROCEEDINGS, 2007, : 718 - +
  • [47] Knowledge retrieval for automatic solving of jigsaw puzzles
    Weiss-Cohen, Miri
    Halevi, Yoram
    International Conference on Computational Intelligence for Modelling, Control & Automation Jointly with International Conference on Intelligent Agents, Web Technologies & Internet Commerce, Vol 2, Proceedings, 2006, : 379 - 383
  • [48] LGPSolver - Solving Logic Grid Puzzles Automatically
    Jabrayilzade, Elgun
    Tekir, Selma
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2020, 2020, : 1118 - 1123
  • [49] Solving Jigsaw Puzzles by the Graph Connection Laplacian
    Huroyan, Vahan
    Lerman, Gilad
    Wu, Hau-Tieng
    SIAM JOURNAL ON IMAGING SCIENCES, 2020, 13 (04): : 1717 - 1753
  • [50] THE SIMPLICITY APPROACH TO SOLVING READING RESEARCH PUZZLES
    MOSENTHAL, PB
    READING TEACHER, 1988, 41 (08): : 818 - 821