/ en / Traditional / help

Beats Biblionetz - Texte

Evaluating the Effectiveness of Parsons Problems for Block-based Programming

Rui Zhi, Min Chi, Tiffany Barnes, Thomas W. Price
Publikationsdatum:
Zu finden in: ICER 2019, 2019
Erste Seite des Textes (PDF-Thumbnail)
Diese Seite wurde seit mehr als 7 Monaten inhaltlich nicht mehr aktualisiert. Unter Umständen ist sie nicht mehr aktuell.

iconZusammenfassungen

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.

Von Rui Zhi, Min Chi, Tiffany Barnes, Thomas W. Price im Konferenz-Band ICER 2019 im Text Evaluating the Effectiveness of Parsons Problems for Block-based Programming (2019)

iconDieses Konferenz-Paper erwähnt ...


Personen
KB IB clear
Tiffany Barnes, Veronica Cateté, Jason Chen, Nick Cheng, Paul Denny, Barbara J. Ericson, James D. Foley, Mark Guzdial, Patricia Haden, Brian Harrington, Juha Helminen, Petri Ihantola, Kyle James Harms, Ville Karavirta, Caitlin L. Kelleher, Zhongxiu Liu, Andrew Luxton-Reilly, Lauri Malmi, Briana B. Morrison, Miranda C. Parker, Dale Parsons, Thomas W. Price, Jochen Rick, Kantwon Rogers, Beth Simon

Begriffe
KB IB clear
blockbasierte Programmiersprachenvisual programming language, Parsons ProblemeParsons Problems, Programmierenprogramming, Programmiersprachenprogramming languages
icon
Bücher
Jahr  Umschlag Titel Abrufe IBOBKBLB
2008ICER 2008 (Michael E. Caspersen, Raymond Lister, Mike Clancy) 1, 1, 2, 6, 4, 9, 8, 7, 4, 9, 9, 18324218185
2012ICER 2012 (Alison Clear, Kate Sanders, Beth Simon) 1, 2, 2, 5, 8, 13, 25, 16, 3, 7, 5, 12189312203
2015ICER 2015 (Brian Dorn, Judy Sheard, Quintin I. Cutts) 1, 3, 2, 8, 9, 13, 22, 8, 7, 6, 6, 122820512259
2016ICER 2016 (Judy Sheard, Josh Tenenberg, Donald Chinn, Brian Dorn) 4, 1, 3, 7, 9, 16, 22, 13, 7, 7, 5, 121412712232
2017SIGCSE 2017 (Michael E. Caspersen, Stephen H. Edwards, Tiffany Barnes, Daniel D. Garcia) 3, 4, 5, 13, 9, 13, 22, 13, 8, 11, 13, 161666616218
2017 secure ICER 2017 (Josh Tenenberg, Donald Chinn, Judy Sheard, Lauri Malmi) 1, 3, 2, 9, 12, 14, 34, 10, 3, 8, 6, 9611349233
2018ICER 2018 (Lauri Malmi, Ari Korhonen, Robert McCartney, Andrew Petersen) 6, 5, 5, 13, 8, 14, 22, 10, 5, 9, 8, 9541869239
icon
Texte
Jahr  Umschlag Titel Abrufe IBOBKBLB
2006 local secure web Parson's Programming Puzzles (Dale Parsons, Patricia Haden) 84, 2, 1, 2, 4, 3, 61576102
2008 local secure web Evaluating a new exam question (Paul Denny, Andrew Luxton-Reilly, Beth Simon) 6, 1, 2, 3, 2, 2, 8, 1, 4, 8, 4, 111181181
2012 local secure web How do students solve parsons programming problems? (Juha Helminen, Petri Ihantola, Ville Karavirta, Lauri Malmi) 1, 1, 3, 2, 1, 3, 2, 2, 4, 8, 5, 129121270
2015 local secure web Analysis of Interactive Features Designed to Enhance Learning in an Ebook (Barbara J. Ericson, Mark Guzdial, Briana B. Morrison) 1, 1, 1, 1, 3, 2, 2, 4, 1, 6, 3, 353371
2016Identifying Design Principles for CS Teacher Ebooks through Design-Based Research (Barbara J. Ericson, Kantwon Rogers, Miranda C. Parker, Briana B. Morrison, Mark Guzdial) 1, 8, 15, 5, 1, 3, 1, 2, 4, 3, 3, 721799
2016 local secure web Distractors in Parsons Problems Decrease Learning Efficiency for Young Novice Programmers (Kyle James Harms, Jason Chen, Caitlin L. Kelleher) 1, 1, 2, 4, 4, 1, 7, 8, 2, 7, 4, 7212754
2017 local secure web Factors Influencing Students' Help-Seeking Behavior while Programming with Human and Computer Tutors (Thomas W. Price, Zhongxiu Liu, Veronica Cateté, Tiffany Barnes) 1, 1, 1, 1, 1, 3, 2, 3, 1, 6, 4, 12221270
2017 local secure web The Code Mangler (Nick Cheng, Brian Harrington) 3400
2018 local secure web Evaluating the Efficiency and Effectiveness of Adaptive Parsons Problems (Barbara J. Ericson, James D. Foley, Jochen Rick) 3100

iconTagcloud

iconZitationsgraph

Diese Grafik ist nur im SVG-Format verfügbar. Dieses Format wird vom verwendeteten Browser offenbar nicht unterstützt.

Diese Grafik fensterfüllend anzeigen (SVG)

iconAnderswo finden

icon

iconVolltext dieses Dokuments

LokalAuf dem WWW Evaluating the Effectiveness of Parsons Problems for Block-based Programming: Fulltext at the ACM Digital Library (lokal: PDF, 2495 kByte; WWW: Link OK )

iconAnderswo suchen  Auch im Biblionetz finden Sie nicht alles. Aus diesem Grund bietet das Biblionetz bereits ausgefüllte Suchformulare für verschiedene Suchdienste an. Biblionetztreffer werden dabei ausgeschlossen.

iconBiblionetz-History Dies ist eine graphische Darstellung, wann wie viele Verweise von und zu diesem Objekt ins Biblionetz eingetragen wurden und wie oft die Seite abgerufen wurde.