1 Search Results for "Ramírez-Alfaro, Paula"

Document
DOI: 10.4230/OASIcs.ICPEC.2020.22
Learning Binary Search Trees Through Serious Games

Authors: Alberto Rojas-Salazar, Paula Ramírez-Alfaro, and Mads Haahr

Published in: OASIcs, Volume 81, First International Computer Programming Education Conference (ICPEC 2020)

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.
Cite as

Alberto Rojas-Salazar, Paula Ramírez-Alfaro, and Mads Haahr. Learning Binary Search Trees Through Serious Games. In First International Computer Programming Education Conference (ICPEC 2020). Open Access Series in Informatics (OASIcs), Volume 81, pp. 22:1-22:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

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

  • Refine by Classification
  • 1 Applied computing → Education

  • Refine by Keyword
  • 1 Binary Search Tree
  • 1 Data Structures
  • 1 Serious Games

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2020

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact