Teaching binary tree algorithms through visual programming

Shows how visual programming can be used to teach the subject of 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 paper contributes to visual programming research...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings 1996 IEEE Symposium on Visual Languages s. 38 - 45
Hlavní autor: Michail, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1996
Témata:
Animation
Binary trees
Computer science
Data structures
Education
Home computing
HTML
Java
Programming profession
World Wide Web
ISBN:9780818675089, 081867508X
ISSN:1049-2615
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Shows how visual programming can be used to teach the subject of 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 paper 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.
ISBN:9780818675089
081867508X
ISSN:1049-2615
DOI:10.1109/VL.1996.545265