Debugging tool to learn algorithms: A case study minimal spanning tree

Khedr, Ahmed Y.; Bahig, Hazem;

Abstract


This paper presents a visualization tool that works as a debugger to learn the minimal spanning tree. The tool allows the user to enter the graph as a matrix and then enable the user to visualize the execution of the algorithm step by step. During the visualization, the tool can handle and debug the errors that occurred by the user. Also, the tool gives the user feedback from the execution of the algorithm by storing the errors that occurred by the user. The teacher and students can use the tool inside and outside the class. The tool was evaluated by the students, and the results show that the tool enhances the understanding of algorithms.


Other data

Title Debugging tool to learn algorithms: A case study minimal spanning tree
Authors Khedr, Ahmed Y.; Bahig, Hazem 
Keywords Education tool;Kruskal's algorithm;Minimal spanning tree;Prim's algorithm;Visualizing tool
Issue Date 1-Jan-2017
Publisher KASSEL UNIV PRESS GMBH
Journal International Journal of Emerging Technologies in Learning 
Volume 12
Issue 4
Start page 90
End page 100
ISSN 18688799
DOI 10.3991/ijet.v12i04.6442
Scopus ID 2-s2.0-85018416666
Web of science ID WOS:000402800600006

Recommend this item

Similar Items from Core Recommender Database

Google ScholarTM

Check

Citations 3 in scopus


Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.