Epplets: A Tool for Solving Parsons Puzzles
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Relationships between reading, tracing and writing skills in introductory programming
Lopez, M., Whalley, J., Robbins, P., & Lister, R. (2008) · Proceedings of the Fourth international Workshop on Computing Education Research · doi:10.1145/1404520.1404531 · Cited by 363
Solving parsons problems versus fixing and writing code
Ericson, B. J., Margulieux, L. E., & Rick, J. (2017) · Proceedings of the 17th Koli Calling International Conference on Computing Education Research · doi:10.1145/3141880.3141895 · Cited by 121
Research works printed but not linked: 11
- 10.1145/3017680.3017704 · DOI · Paper page
- 10.1207/s15326985ep2801_3 · DOI · Paper page
- 10.1145/1404520.1404532 · DOI · Paper page
- 10.1145/2787622.2787731 · DOI · Paper page
- 10.1145/2361276.2361300 · DOI · Paper page
- 10.1145/1822090.1822178 · DOI
- 10.28945/1394 · DOI · Paper page
- 10.1007/11768012_18 · DOI
- 10.1007/978-3-319-61425-0_56 · doi:10.1007/978-3-319-61425-0_56
- 10.1145/2839509.2844617 · DOI · Paper page
- Parsons D, Proc. 8th Australasian Conference on Computing Education -, 52
Cited by
50 Years of CS1 at SIGCSE: A Review of the Evolution of Introductory Programming Education Research
Becker, B. A., & Quille, K. (2019) · Proceedings of the 50th ACM Technical Symposium on Computer Science Education · doi:10.1145/3287324.3287432 · Cited by 107
“For instance, Kumar developed Epplets to help students solve Parsons Puzzles [26], and the Blackbox project [8] provides tools and a large programming dataset for researchers.”
BackgroundEvaluating the Efficiency and Effectiveness of Adaptive Parsons Problems
Ericson, B. J., Foley, J. D., & Rick, J. (2018) · Proceedings of the 2018 ACM Conference on International Computing Education Research · doi:10.1145/3230977.3231000 · Cited by 70
Reeves, B., Sarsa, S., Prather, J., Denny, P., Becker, B. A., Hellas, A., Kimmel, B., Powell, G., & Leinonen, J. (2023) · Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 1 · doi:10.1145/3587102.3588805 · Cited by 56
“Inter-problem adaptation allowed for the automatic selection of subsequent problems based on current problem performance, an idea also studied by Kumar [25].”
BackgroundLehtinen, T., Haaranen, L., & Leinonen, J. (2023) · Proceedings of the 25th Australasian Computing Education Conference · doi:10.1145/3576123.3576129 · Cited by 17
Metadata
- Authors
- Kumar, A. N.
- Venue
- Proceedings of the 49th ACM Technical Symposium on Computer Science Education
- Publisher
- ACM
- Published
- 2018-02-21
- Pages
- 527-532
- OpenAlex
- W2789147155
- Cited by
- 35
- References
- 2
- FWCI
- 5.41
- Type
- conference paper
- Language
- en
- Open access
- closed
- Funders
- National Science Foundation (DUE-1502564, DUE-1432190)
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
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.