/ en / Traditional / mobile / help

Beats Biblionetz - Texte

Distractors in Parsons Problems Decrease Learning Efficiency for Young Novice Programmers

Kyle James Harms, Jason Chen, Caitlin L. Kelleher
Publikationsdatum:
Zu finden in: ICER 2016 (Seite 241 bis 250), 2016
Erste Seite des Textes (PDF-Thumbnail)

iconZusammenfassungen

Parsons problems are an increasingly popular method for helping inexperienced programmers improve their programming skills. In Parsons problems, learners are given a set of programming statements that they must assemble into the correct order. Parsons problems commonly use distractors, extra statements that are not part of the solution. Yet, little is known about the effect distractors have on a learner's ability to acquire new programming skills. We present a study comparing the effectiveness of learning programming from Parsons problems with and without distractors. The results suggest that distractors decrease learning efficiency. We found that distractor participants showed no difference in transfer task performance compared to those without distractors. However, the distractors increased learners cognitive load, decreased their success at completing Parsons problems by 26%, and increased learners' time on task by 14%.

Von Kyle James Harms, Jason Chen, Caitlin L. Kelleher im Konferenz-Band ICER 2016 im Text Distractors in Parsons Problems Decrease Learning Efficiency for Young Novice Programmers (2016)

iconDieses Konferenz-Paper erwähnt...


Personen
KB IB clear
Paul Denny, Brian Dorn, Barbara J. Ericson, J. Dexter Fletcher, Mark Guzdial, Mark J. Guzdial, Juha Helminen, Petri Ihantola, Ville Karavirta, Andrew J. Ko, Michael J. Lee, Andrew Luxton-Reilly, Lauri Malmi, Briana B. Morrison, Beth Simon, Sigmund Tobias, Alexander P. Wind

Begriffe
KB IB clear
Lernenlearning, Parsons Problems, Programmierenprogramming
icon
Bücher
Jahr UmschlagTitelAbrufeIBOBKBLB
2008ICER 2008 (Michael E. Caspersen, Raymond Lister, Mike Clancy) 5, 3, 3, 3, 3, 1, 2, 1, 1, 2, 2, 31339399
2012ICER 2012 (Alison Clear, Kate Sanders, Beth Simon) 4, 4, 4, 4, 5, 2, 2, 2, 2, 1, 3, 4784493
2014Handbook of Research on Educational Communications and Technology (J. Michael Spector, M. David Merrill, Jan Elen, M. J. Bishop) 4, 4, 7, 13, 5, 2, 3, 4, 2, 3, 7, 7252087487
2014ICER 2014 (Quintin I. Cutts, Beth Simon, Brian Dorn) 3, 3, 7, 6, 5, 2, 1, 5, 2, 3, 5, 491444171
2015ICER 2015 (Brian Dorn, Judy Sheard, Quintin I. Cutts) 4, 4, 3, 5, 4, 2, 3, 4, 1, 3, 3, 5182025144
icon
Texte
Jahr UmschlagTitelAbrufeIBOBKBLB
2008    Evaluating a new exam question (Paul Denny, Andrew Luxton-Reilly, Beth Simon) 1, 2, 3, 1, 2, 2, 2, 1, 1, 1, 1, 135129
2012    How do students solve parsons programming problems? (Juha Helminen, Petri Ihantola, Ville Karavirta, Lauri Malmi) 1, 3, 3, 1, 1, 1, 1, 1, 1, 2, 1, 133121
2014    Game-Based Learning (Sigmund Tobias, J. Dexter Fletcher, Alexander P. Wind) 1, 3, 1, 1, 1, 2, 2, 3, 2, 1, 5, 2212295
2014    Measuring cognitive load in introductory CS (Briana B. Morrison, Brian Dorn, Mark Guzdial) 1, 3, 4, 2, 1, 1, 1, 1, 1, 1, 1, 135130
2015    Comparing the Effectiveness of Online Learning Approaches on CS1 Learning Outcomes (Michael J. Lee, Andrew J. Ko) 1, 5, 1, 1, 2, 1, 3, 3, 1, 1, 1, 211225
2015    Analysis of Interactive Features Designed to Enhance Learning in an Ebook (Barbara J. Ericson, Mark J. Guzdial, Briana B. Morrison) 1, 2, 4, 1, 1, 1, 1, 1, 1, 2, 1, 123128

iconZitationsgraph

Diese Grafik fensterfüllend anzeigen als Pixelgrafik (PNG) Vektorgrafik (SVG)

iconAnderswo finden

icon

iconVolltext dieses Dokuments

LokalAuf dem WWW Distractors in Parsons Problems Decrease Learning Efficiency for Young Novice Programmers: Fulltext at the ACM Digital Library (lokal: PDF, 1566 kByte; WWW: Link OK 2019-05-28)

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.