“…Additionally, the game possesses more levels that focus on other data structures such as queues and trees. Also targeting the stack, Ismail et al [13] reported Stack Em Up, a serious game based on the Tower of Hanoi puzzle, and it provides three levels of difficulty. Other games based on the Tower of Hanoi puzzle are HTML5 Hanoi Tower [28] and the Hanoi Tower Game [6].…”
Section: Related Workmentioning
confidence: 99%
“…In particular, the articles do not discuss the learning principles in detail and also fail to explain how their games apply them. For instance, [13,20,26,28,31] suggest that their games may increase the motivation of the student, and consequently, their games may increase the student's engagement. However, these studies do not report the type of motivation that they expect (for example, goaloriented motivation or task-oriented motivation), or how their games increase motivation.…”
Data structures and algorithms are core topics in Computer Science, and they are essential for the development of efficient software. However, data structures and algorithmic concepts are abstract and difficult to relate to previous knowledge. From a constructivist point of view, it is important that new experiences and information link to previous knowledge in order to create new knowledge. This paper presents work-in-progress on the development and evaluation of a serious game for teaching Binary Search Trees (BST) called DS-Hacker (Data Structure Hacker). DS-Hacker aims to introduce BST concepts to college students by means of relating well-known game elements with BST concepts.
“…Additionally, the game possesses more levels that focus on other data structures such as queues and trees. Also targeting the stack, Ismail et al [13] reported Stack Em Up, a serious game based on the Tower of Hanoi puzzle, and it provides three levels of difficulty. Other games based on the Tower of Hanoi puzzle are HTML5 Hanoi Tower [28] and the Hanoi Tower Game [6].…”
Section: Related Workmentioning
confidence: 99%
“…In particular, the articles do not discuss the learning principles in detail and also fail to explain how their games apply them. For instance, [13,20,26,28,31] suggest that their games may increase the motivation of the student, and consequently, their games may increase the student's engagement. However, these studies do not report the type of motivation that they expect (for example, goaloriented motivation or task-oriented motivation), or how their games increase motivation.…”
Data structures and algorithms are core topics in Computer Science, and they are essential for the development of efficient software. However, data structures and algorithmic concepts are abstract and difficult to relate to previous knowledge. From a constructivist point of view, it is important that new experiences and information link to previous knowledge in order to create new knowledge. This paper presents work-in-progress on the development and evaluation of a serious game for teaching Binary Search Trees (BST) called DS-Hacker (Data Structure Hacker). DS-Hacker aims to introduce BST concepts to college students by means of relating well-known game elements with BST concepts.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.