algorithms and data structures are one of the most difficult parts of Computer Science for students to learn. It is therefore essential to develop approaches and tools that facilitate the acquisition of this crucial p...
详细信息
ISBN:
(纸本)9781665444347
algorithms and data structures are one of the most difficult parts of Computer Science for students to learn. It is therefore essential to develop approaches and tools that facilitate the acquisition of this crucial part of a computer scientist's training. Based on the hypothesis that making the access to information and self-assessment easier improves the learning of the concepts, in this work we propose a graphical tool that allows the student to navigate through the topics of the subject, and to reach collections of self-assessment exercises on each of the topic. For this purpose, the information of the subject has been organized in a navigable hierarchy of topics that allows students to access exercises in a simple and visual way, on the one hand, but also to easily learn the relationships between the different concepts of the subject. These exercises allow students to self-evaluate and solve their doubts, as well as to find analogies between different topics in the hierarchy. This process is complemented by a web page recommender for the topics of the hierarchy. Results according to a questionnaire about the tool answered by the students indicate that it is considered of high utility and interest.
Data structures and algorithms are important foundation topics in computer science education. However, they are often complex and hard to understand. As a result, educational tools, such as algorithm visualization sys...
详细信息
Data structures and algorithms are important foundation topics in computer science education. However, they are often complex and hard to understand. As a result, educational tools, such as algorithm visualization systems, are always needed to help students better learn and understand algorithms. The focus on graphics and sound instead of pedagogical aspects in the design of current algorithm visualization systems undermines effectiveness in teaching algorithms. In addition, most algorithm visualization systems lack features that encourage student engagement. This research addresses some required issues in creating algorithm visualization techniques by integrating learning theories and models in algorithm learning and by visualizing algorithms using computer games to fully engage students in the algorithm learning process. A new algorithm visualization and learning approach, namely Algorithm Visualization using Serious Games (AVuSG), has been introduced. It visualizes algorithms using educational or serious games to benefit from their popularity and engagement to motivate students who are learningalgorithms. Moreover, it facilitates the students' assessment using the winning-losing criteria of computer games without the need for external questions. The conceptual framework of AVuSG visualizes the algorithm to be learned using three forms of representations: Text, Flowchart, and Computer Game. Moreover, it defines three types of learning processes: Viewing,Playing, and Designing, which learners can use to engage with any of the three forms of the produced algorithm visualizations.@pqdt@break@Finally, AVuSG integrates learning theories with game design to introduce three learning models: Bloom Based, Gagne Based, and Constructivist Models, which can be adopted either by students to learn the algorithm or by the instructors to teach the algorithm depending on the learning objectives that they want to achieve.@pqdt@break@To demonstrate AVuSG framework, a software syste
暂无评论