PathFinder: A Visualization eMathTeacher for Actively Learning Dijkstra's Algorithm

Authors:
M. G. Sánchez-Torrubia;C. Torres-Blanc;M. A. López-Martínez
Affiliations:
Applied Mathematics Department, Universidad Politécnica de Madrid, Madrid, Spain;Applied Mathematics Department, Universidad Politécnica de Madrid, Madrid, Spain;Applied Mathematics Department, Universidad Politécnica de Madrid, Madrid, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 7
Cited 6

Assessing the benefits of interactive prediction using Web-based algorithm animation courseware

Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Algorithm simulation with automatic assessment

Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education
A testbed for pedagogical requirements in algorithm visualizations

Proceedings of the 7th annual conference on Innovation and technology in computer science education
Dimensions of distance learning for computer education

ACM SIGCSE Bulletin
Exploring the role of visualization and engagement in computer science education

Working group reports from ITiCSE on Innovation and technology in computer science education
Evaluating the educational impact of visualization

Working group reports from ITiCSE on Innovation and technology in computer science education
Mamdani's fuzzy inference eMathTeacher: a tutorial for active learning

WSEAS Transactions on Computers

Active learning of greedy algorithms by means of interactive experimentation

ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education
GRAPHs: a learning environment for graph algorithm simulation primed for automatic fuzzy assessment

Proceedings of the 10th Koli Calling International Conference on Computing Education Research
An eLearning environment designed for integrating eMathTeacher: compliant graph algorithm simulators

Proceedings of the 10th Koli Calling International Conference on Computing Education Research
A novel algorithm for all pairs shortest path problem based on matrix multiplication and pulse coupled neural network

Digital Signal Processing
An approach to automatic learning assessment based on the computational theory of perceptions

Expert Systems with Applications: An International Journal
An Experimental Method for the Active Learning of Greedy Algorithms

ACM Transactions on Computing Education (TOCE)

Quantified Score

Hi-index	0.01

Visualization

Abstract

PathFinder is a new eMathTeacher for actively learning Dijkstra's algorithm. In [Sanchez-Torrubia, M. G., C. Torres-Blanc and J. B. Castellanos, Defining eMathTeacher tools and comparing them with e&bLearning web based tools, in: Proceedings of the International Conference on Engineering and Mathematics (ENMA), 2007] the concept of eMathTeacher was defined and the minimum as well as some additional requirements were described. The tool presented here is an enhanced paradigm of this new concept on Computer Aided Instruction (CAI) resources: an application designed following the eMathTeacher philosophy for active eLearning. The highlighting new feature provided by this application is an animated algorithm visualization panel showing, on the code, the current step the student is executing and/or where there is a user's mistake within the algorithm running. PathFinder also includes another two interesting new features: an active framework area for the algorithm data and the capability of saving/retrieving the created graph.