License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICPEC.2020.22
URN: urn:nbn:de:0030-drops-123097
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12309/
Go to the corresponding OASIcs Volume Portal

Rojas-Salazar, Alberto ; Ramírez-Alfaro, Paula ; Haahr, Mads

Learning Binary Search Trees Through Serious Games

pdf-format:
OASIcs-ICPEC-2020-22.pdf (0.4 MB)

Abstract

Data structures and algorithms are core topics in Computer Science, but they are difficult topics to grasp. Data structures and algorithmic concepts are abstract and difficult to relate to previous knowledge. To facilitate the learning process of these topics, learning tools that link new information with previous knowledge in an active way may be a useful approach to teach data structures and their algorithms. Furthermore, serious games have the potential to serve as a learning tool that accomplishes both objectives: to link new information with previous knowledge and to facilitate active learning. To tackle these issues, we developed DS-Hacker, an action-adventure serious game that utilizes the game elements to represent the Binary Search Tree (BST) properties and structure. In this paper, we report the results of a pilot experiment that compares the learning gains after completing two learning activities: (1) playing a serious game for learning Binary Search Trees, and (2) reading a summary and watching two video tutorials. Additionally, we report the results from a qualitative survey that evaluated the game usability, player satisfaction and the participants' perception about the means used by the game to deliver the BST concepts.

BibTeX - Entry

@InProceedings{rojassalazar_et_al:OASIcs:2020:12309,
  author =	{Alberto Rojas-Salazar and Paula Ram{\'\i}rez-Alfaro and Mads Haahr},
  title =	{{Learning Binary Search Trees Through Serious Games}},
  booktitle =	{First International Computer Programming Education Conference (ICPEC 2020)},
  pages =	{22:1--22:7},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-153-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{81},
  editor =	{Ricardo Queir{\'o}s and Filipe Portela and M{\'a}rio Pinto and Alberto Sim{\~o}es},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12309},
  URN =		{urn:nbn:de:0030-drops-123097},
  doi =		{10.4230/OASIcs.ICPEC.2020.22},
  annote =	{Keywords: Binary Search Tree, Data Structures, Serious Games}
}

Keywords: Binary Search Tree, Data Structures, Serious Games
Collection: First International Computer Programming Education Conference (ICPEC 2020)
Issue Date: 2020
Date of publication: 15.06.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI