MatrixPro - A Tool for Demonstrating Data Structures and Algorithms Ex Tempore

Authors:
Ville Karavirta;Ari Korhonen;Lauri Malmi;Kimmo Stalnacke
Affiliations:
Helsinki University of Technology;Helsinki University of Technology;Helsinki University of Technology;Helsinki University of Technology
Venue:
ICALT '04 Proceedings of the IEEE International Conference on Advanced Learning Technologies
Year:
2004

Citing 0
Cited 6

Algorithm visualization using concept keyboards

SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
ActiveTutor

ICALT '05 Proceedings of the Fifth IEEE International Conference on Advanced Learning Technologies
Concept keyboards in the animation of standard algorithms

Journal of Visual Languages and Computing
Presentation of automatic conflictive animations

Koli '08 Proceedings of the 8th International Conference on Computing Education Research
Conflictive animations as engaging learning tools

Koli Calling '07 Proceedings of the Seventh Baltic Sea Conference on Computing Education Research - Volume 88
Defining and evaluating conflictive animations for programming education: the case of jeliot ConAn

Proceedings of the 45th ACM technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithm animation has been researched since early 1980ýs and many different visualization systems have been developed. However, most of them have remained as research prototypes and almost none have gained wide acceptance by teachers as classroom demonstration tools. One of the key reasons for this has been that preparing animations has been too laborious. In this paper, we demonstrate a new tool,MatrixPro, in which animations are generated in terms of visual algorithm simulation. The user can graphically invoke ready-made operations available in the library to simulate the working of real algorithms. Since the system understands the semantics of the operations, the teacher can ex tempore demonstrate the execution of algorithms with different input sets, or work with "what-if" questions students ask in lectures. Such an approach lowers considerably the step for adopting algorithm visualization as a regular lecture tool.