[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3291279.3339419acmconferencesArticle/Chapter ViewAbstractPublication PagesicerConference Proceedingsconference-collections
research-article
Public Access

Evaluating the Effectiveness of Parsons Problems for Block-based Programming

Published: 30 July 2019 Publication History

Abstract

Parsons problems are program puzzles, where students piece together code fragments to construct a program. Similar to block-based programming environments, Parsons problems eliminate the need to learn syntax. Parsons problems have been shown to improve learning efficiency when compared to writing code or fixing incorrect code in lab studies, or as part of a larger curriculum. In this study, we directly compared Parsons problems with block-based programming assignments in classroom settings. We hypothesized that Parsons problems would improve students' programming efficiency on the lab assignments where they were used, without impacting performance on the subsequent, related homework or the later programming project. Our results confirmed our hypothesis, showing that on average Parsons problems took students about half as much time to complete compared to equivalent programming problems. At the same time, we found no evidence to suggest that students performed worse on subsequent assignments, as measured by performance and time on task. The results indicate that the effectiveness of Parsons problems is not simply based on helping students avoid syntax errors. We believe this is because Parsons problems dramatically reduce the programming solution space, letting students focus on solving the problem rather than having to solve the combined problem of devising a solution, searching for needed components, and composing them together.

References

[1]
Yoav Benjamini and Yosef Hochberg. 1995. Controlling the false discovery rate: apractical and powerful approach to multiple testing. Journal of the Royal statistical society 57, 1 (1995), 289--300.
[2]
Nick Cheng and Brian Harrington. 2017. The Code Mangler: Evaluating Coding Ability Without Writing Any Code. Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education(2017), 123--128.
[3]
Trevor F Cox and Michael AA Cox. 2000. Multidimensional scaling. Chapman and hall/CRC.
[4]
Paul Denny, Andrew Luxton-Reilly, and Beth Simon. 2008. Evaluating a new exam question: Parsons problems. In Proceedings of the fourth international workshop on computing education research. ACM, 113--124.
[5]
Olive Jean Dunn. 1964. Multiple comparisons using rank sums. Technometrics 6, 3 (1964), 241--252.
[6]
Barbara J Ericson, James D Foley, and Jochen Rick. 2018. Evaluating the Efficiency and Effectiveness of Adaptive Parsons Problems. In Proceedings of the 2018 ACM Conference on International Computing Education Research. ACM, 60--68.
[7]
Barbara J. Ericson, Mark J. Guzdial, and Briana B. Morrison. 2015. Analysis of Interactive Features Designed to Enhance Learning in an Ebook. Proceedings of the eleventh annual International Conference on International Computing Education Research - ICER '15(2015), 169--178.
[8]
Barbara J Ericson, Lauren E Margulieux, and Jochen Rick. 2017. Solving parsons problems versus fixing and writing code. In Proceedings of the 17th Koli Calling Conference on Computing Education Research. ACM, 20--29.
[9]
Barbara J. Ericson, Kantwon Rogers, Miranda Parker, Briana Morrison, and Mark Guzdial. 2016. Identifying Design Principles for CS Teacher Ebooks through Design-Based Research. (2016), 191--200.
[10]
Geela Venise Firmalo Fabic, Antonija Mitrovic, and Kourosh Neshatian. 2017. A Comparison of Different Types of Learning Activities in a Mobile Python Tutor. Proceedings of the 25th International Conference on Computers in Education(2017), 604--613.
[11]
Stuart Garner. 2007. An Exploration of How a Technology-Facilitated Part-Complete Solution Method Supports the Learning of Computer Programming. Issues in Informing Science and Information Technology 4 (2007), 491--501.
[12]
Kyle James Harms, Jason Chen, and Caitlin L Kelleher. 2016. Distractors in Parsons Problems Decrease Learning Efficiency for Young Novice Programmers. In Proceedings of the 2016 ACM Conference on International Computing Education Research. ACM, 241--250.
[13]
Kyle J Harms, Noah Rowlett, and Caitlin Kelleher. 2015. Enabling independent learning of programming concepts through programming completion puzzles. In Visual Languages and Human-Centric Computing (VL/HCC), 2015 IEEE Symposium on. IEEE, 271--279.
[14]
Juha Helminen, Petri Ihantola, Ville Karavirta, and Satu Alaoutinen. 2013. How do students solve parsons programming problems? - Execution-based vs. line-based feedback. Proceedings - 2013 Learning and Teaching in Computing and Engineering, LaTiCE 2013(2013), 55--61.
[15]
Juha Helminen, Petri Ihantola, Ville Karavirta, and Lauri Malmi. 2012. How do students solve parsons programming problems?: An analysis of interaction traces. In Proceedings of the ninth annual international conference on International computing education research. ACM, 119--126.
[16]
Michelle Ichinco, Kyle J Harms, and Caitlin Kelleher. 2017. Towards Understanding Successful Novice Example User in Blocks-Based Programming. Journal of Visual Languages and Sentient Systems(2017), 101--118.
[17]
Petri Ihantola, Juha Helminen, and Ville Karavirta. 2013. How to Study Program-ming on Mobile Touch Devices - Interactive Python Code Exercises. Koli Calling'13(2013), 51--58.
[18]
Petri Ihantola and Ville Karavirta. 2011. Two-Dimensional Parson's Puzzles:The Concept, Tools, and First Observations. Journal of Information Technology Education: Innovations in Practice10 (2011), 119--132.
[19]
Richard E Mayer and Roxana Moreno. 2003. Nine ways to reduce cognitive loadin multimedia learning. Educational psychologist 38, 1 (2003), 43--52.
[20]
Briana B Morrison, Lauren E Margulieux, Barbara Ericson, and Mark Guzdial. 2016. Subgoals help students solve Parsons problems. In Proceedings of the 47th ACM Technical Symposium on Computing Science Education. ACM, 42--47.
[21]
Dale Parsons and Patricia Haden. 2006. Parson's programming puzzles: a fun and effective learning tool for first programming courses. In Proceedings of the 8th Australasian Conference on Computing Education-Volume 52. Australian Computer Society, Inc., 157--163.
[22]
Thomas W Price and Tiffany Barnes. 2015. Comparing textual and block interface sin a novice programming environment. In Proceedings of the eleventh annual International Conference on International Computing Education Research. ACM, 91--99.
[23]
Thomas W Price, Yihuan Dong, and Tiffany Barnes. 2016. Generating Data-driven Hints for Open-ended Programming. EDM16 (2016), 191--198.
[24]
Thomas W Price, Yihuan Dong, and Dragan Lipovac. 2017. iSnap: towards intelligent tutoring in novice programming environments. In Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education. ACM, 483--488.
[25]
Thomas W Price, Zhongxiu Liu, Veronica Cateté, and Tiffany Barnes. 2017. Factors Influencing Students' Help-Seeking Behavior while Programming with Human and Computer Tutors. In Proceedings of the 2017 ACM Conference on International Computing Education Research. ACM, 127--135.
[26]
Thomas W Price, Rui Zhi, and Tiffany Barnes. 2017. Evaluation of a Data-driven Feedback Algorithm for Open-ended Programming. In EDM.
[27]
Kelly Rivers and Kenneth R Koedinger. 2014. Automating hint generation with solution space path construction. In International Conference on Intelligent Tutoring Systems. Springer, 329--339.
[28]
John Sweller. 2010. Element interactivity and intrinsic, extraneous, and germane cognitive load. Educational Psychology Review 22, 2 (2010), 123--138. arXiv:arXiv:1002.2562v1
[29]
John Sweller, Jeroen JG Van Merrienboer, and Fred GWC Paas. 1998. Cognitive architecture and instructional design. Educational psychology review 10, 3 (1998).
[30]
Jeroen JG Van Merriënboer and Marcel BM De Croock. 1992. Strategies for computer-based programming instruction: Program completion vs. program generation. Journal of Educational Computing Research 8, 3 (1992), 365--394.
[31]
David Weintrop and Uri Wilensky. 2017. Comparing block-based and text-based programming in high school computer science classrooms. ACM Transactions on Computing Education (TOCE)18, 1 (2017), 3.
[32]
Rui Zhi, Thomas W. Price, Nicholas Lytle, Yihuan Dong, and Tiffany Barnes. 2018. Reducing the State Space of Programming Problems through Data-Driven Feature Detection. In EDM Workshop

Cited By

View all
  • (2024)Programming Language Learning in K-12 EducationEmpowering STEM Educators With Digital Tools10.4018/979-8-3693-9806-7.ch010(227-260)Online publication date: 1-Nov-2024
  • (2024)Parsons Problems for Equivalence Proofs in LogicProceedings of the 24th Koli Calling International Conference on Computing Education Research10.1145/3699538.3699551(1-12)Online publication date: 12-Nov-2024
  • (2024)Automating Personalized Parsons Problems with Customized Contexts and ConceptsProceedings of the 2024 on Innovation and Technology in Computer Science Education V. 110.1145/3649217.3653568(688-694)Online publication date: 3-Jul-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ICER '19: Proceedings of the 2019 ACM Conference on International Computing Education Research
July 2019
375 pages
ISBN:9781450361859
DOI:10.1145/3291279
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. block-based programming
  2. parsons problems
  3. problem solving

Qualifiers

  • Research-article

Funding Sources

Conference

ICER '19
Sponsor:

Acceptance Rates

ICER '19 Paper Acceptance Rate 28 of 137 submissions, 20%;
Overall Acceptance Rate 189 of 803 submissions, 24%

Upcoming Conference

ICER 2025
ACM Conference on International Computing Education Research
August 3 - 6, 2025
Charlottesville , VA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)197
  • Downloads (Last 6 weeks)27
Reflects downloads up to 14 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Programming Language Learning in K-12 EducationEmpowering STEM Educators With Digital Tools10.4018/979-8-3693-9806-7.ch010(227-260)Online publication date: 1-Nov-2024
  • (2024)Parsons Problems for Equivalence Proofs in LogicProceedings of the 24th Koli Calling International Conference on Computing Education Research10.1145/3699538.3699551(1-12)Online publication date: 12-Nov-2024
  • (2024)Automating Personalized Parsons Problems with Customized Contexts and ConceptsProceedings of the 2024 on Innovation and Technology in Computer Science Education V. 110.1145/3649217.3653568(688-694)Online publication date: 3-Jul-2024
  • (2024)Scaffolding Novices: Analyzing When and How Parsons Problems Impact Novice Programming in an Integrated Science AssignmentProceedings of the 2024 ACM Conference on International Computing Education Research - Volume 110.1145/3632620.3671110(42-54)Online publication date: 12-Aug-2024
  • (2024)Neurodiverse Programmers and the Accessibility of Parsons Problems: An Exploratory Multiple-Case StudyProceedings of the 55th ACM Technical Symposium on Computer Science Education V. 110.1145/3626252.3630898(491-497)Online publication date: 7-Mar-2024
  • (2024)SQL Puzzles: Evaluating Micro Parsons Problems With Different Feedbacks as Practice for NovicesProceedings of the 2024 CHI Conference on Human Factors in Computing Systems10.1145/3613904.3641910(1-15)Online publication date: 11-May-2024
  • (2023)Multi-Institutional Multi-National Studies of Parsons ProblemsProceedings of the 2023 Working Group Reports on Innovation and Technology in Computer Science Education10.1145/3623762.3633498(57-107)Online publication date: 22-Dec-2023
  • (2023)Conducting Multi-Institutional Studies of Parsons ProblemsProceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 210.1145/3587103.3594211(571-572)Online publication date: 29-Jun-2023
  • (2023)Exploring the Difficulty of Faded Parsons Problems for Programming EducationProceedings of the 25th Australasian Computing Education Conference10.1145/3576123.3576136(113-122)Online publication date: 30-Jan-2023
  • (2023)Studying the effect of AI Code Generators on Supporting Novice Learners in Introductory ProgrammingProceedings of the 2023 CHI Conference on Human Factors in Computing Systems10.1145/3544548.3580919(1-23)Online publication date: 19-Apr-2023
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media