by Amir Michail
In: Proceedings of the 12thIEEE Symposium on Visual Languages IEEE Computer Society Press, Los Alamitos, CA
ftp://ftp.cs.washington.edu/tr/1997/05/UW-CSE-97-05-01.PS.Z
Add To MetaCart
Abstract:
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 introduce Opsis, a system we built to demonstrate the ideas in this paper. (Opsis is a Java applet and can be accessed at
Citations
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1992
|
|
168
|
Zeus: A System for Algorithm Animation and Multiview Editing (Research Report No
– Brown
- 1992
|
|
91
|
A Practical Theory of Programming
– Hehner
- 1993
|
|
70
|
Empirically Evaluating the Use of Animations to Teach Algorithms
– Lawrence, Badre, et al.
- 1994
|
|
45
|
Visual programming, programming by example, and program visualization: a taxonomy
– Myers
- 1986
|
|
34
|
Data Structures and Their Algorithms
– Lewis, Denenberg
- 1991
|
|
31
|
Pygmalion: A creative programming environment
– Smith
- 1975
|
|
7
|
An example of the manipulation of directed graphs in the ambit/g programming language
– Christensen
- 1968
|
|
7
|
Thinkpad: A graphics system for programming by demonstrations
– Rubin, Golin, et al.
- 1985
|
|
6
|
A state-based visual language for a demonstrational visual shell
– Modugno, Myers
- 1994
|
|
3
|
An introduction to AMBIT/L, a diagrammatic language for list processing
– Christensen
- 1971
|
|
3
|
Programming by Abstract Demonstration
– Curry
- 1978
|
|
3
|
PICT: Experiments in the Design of Interactive, Graphical Programming Environments
– Glinert
- 1985
|
