VisA: towards a students' green card to automata theory and formal languages
ACSE '98 Proceedings of the 3rd Australasian conference on Computer science education
Future Perspectives - Introduction
Revised Lectures on Software Visualization, International Seminar
A Language and System for Constructing and Presenting Low Fidelity Algorithm Visualizations
Revised Lectures on Software Visualization, International Seminar
Algorithm Explanation: Visualizing Abstract States and Invariants
Revised Lectures on Software Visualization, International Seminar
Structure and Constraints in Interactive Exploratory Algorithm Learning
Revised Lectures on Software Visualization, International Seminar
Algorithm animation using shape analysis: visualising abstract executions
SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
| Hi-index | 0.00 |
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating abstract tree fragments (not necessarily just single nodes) in a visual way. This work contributes to visual programming research by combining elements of animation, programming, and proof to produce an educational visual programming tool. In addition, we describe our experiences with Opsis, a system we built to demonstrate the ideas in this paper. (Opsis is a Java applet and can be accessed at http://www.cs.washington.edu/homes/amir/Opsis.html.) Finally, we make the claim that visual programming is an ideal way to teach data structure algorithms. Keywords: visual programming, education, teaching, data structures, binary trees, algorithms, animation, proof