Hash Table Notional Machines: A Comparison of 2D and 3D Representations
Background: Notional machines appear to be an essential aspect of computing education, but there are surprisingly few papers that identify strengths and weaknesses of particular notional machine representations and their impact on student learning.
Purpose: This article strives to fill a gap in the notional machine literature by using a randomized controlled trial to compare the effectiveness of different notional machine representations.
Methods: A multinational randomized controlled trial was conducted using different notional machine representations for two hash table algorithms: chaining and open addressing. Students were randomly assigned a video sequence using either 2D or 3D representations. Hypotheses were tested about learning, perceptions of helpfulness, and engagement based upon the extensive research on representations in science and mathematics education as well as on the theory of cognitive load.
Findings: Our analysis revealed minimal differential effect of 2D vs 3D representational form on student learning, perceptions of helpfulness, and engagement.
Implications: In addition to addressing a lack of research evaluating notional machines, our paper provides an example of how educational research can inform the design and evaluation of notional machines.
Sat 7 DecDisplayed time zone: (UTC) Coordinated Universal Time change
22:00 - 23:00 | |||
22:00 30mPaper | Can ChatGPT pass a Theory of Computing Course? Conference Matei Golesteanu United States Military Academy, Garrett Vowinkel United States Military Academy, Ryan Dougherty United States Military Academy | ||
22:30 30mPaper | Hash Table Notional Machines: A Comparison of 2D and 3D Representations Conference Colleen M. Lewis University of Illinois Urbana-Champaign, Craig S. Miller DePaul University, Johan Jeuring Utrecht University, Janice Pearce Berea College, Andrew Petersen University of Toronto |