Hash Table Notional Machines: A Comparison of 2D and 3D Representations

Publication date

2024-12-05

Authors

Lewis, Colleen
Miller, Craig S.
Jeuring, JohanISNI 0000000110063265
Pearce, Janice L.
Petersen, Andrew

Editors

Advisors

Supervisors

Document Type

Part of book
Open Access logo

License

unspecified

Abstract

Background: Notional machines appear to be an essential aspect of computing education, but there are few papers that identify strengths and weaknesses of particular notional machines. Purpose: This article fills a gap in the notional machine literature by using a randomized controlled trial to compare the effectiveness of different notional machine representations. Methods: Our study used notional machines for two hash table algorithms: chaining and open addressing. Students were randomly assigned a video sequence using either 2D or 3D representations. Findings: We found minimal effect of 2D vs 3D representational form on students' learning and perceptions of helpfulness. Implications: Our paper provides an example of how educational research can inform the design and evaluation of notional machines.

Keywords

Citation

Lewis, C, Miller, C S, Jeuring, J, Pearce, J L & Petersen, A 2024, Hash Table Notional Machines : A Comparison of 2D and 3D Representations. in SIGCSE Virtual 2024: Proceedings of the 2024 on ACM Virtual Global Computing Education Conference. Association for Computing Machinery, pp. 109-115. https://doi.org/10.1145/3649165.3690118