ACM Home Page
Please provide us with feedback. Feedback
Do algorithm animations assist learning?: an empirical study and analysis
Full text pdf formatPdf (639 KB)
Source Conference on Human Factors in Computing Systems archive
Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems table of contents
Amsterdam, The Netherlands
Pages: 61 - 66  
Year of Publication: 1993
ISBN:0-89791-575-5
Authors
John Stasko  Graphics, Visualization and Usability Center, College of Computing, Georgia Institute of Technology, Atlanta, GA
Albert Badre  Graphics, Visualization and Usability Center, College of Computing, Georgia Institute of Technology, Atlanta, GA
Clayton Lewis  Institute of Cognitive Science, Department of Computer Science, University of Colorado at Boulder, Boulder, CO
Sponsors
NGI : Dutch Computer Soc - Nederlands Genoostschapvoor Informatica
Human Factors Soc : Human Factors Society
IEEE-CS : Computer Society
IFIP : International Federation for Information Processing
SIGCAPH: ACM SIGCAPH Computers and the Physically Handicapped
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
SIGGROUP: ACM Special Interest Group on Supporting Group Work
Austrian Comp Soc : Austrian Computer Society
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 70,   Citation Count: 37
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/169059.169078
What is a DOI?

ABSTRACT

Algorithm animations are dynamic graphical illustrations of computer algorithms, and they are used as teaching aids to help explain how the algorithms work. Although many people believe that algorithm animations are useful this way, no empirical evidence has ever been presented supporting this belief. We have conducted an empirical study of a priority queue algorithm animation, and the study's results indicate that the animation only slightly assisted student understanding. In this article, we analyze those results and hypothesize why algorithm animations may not be as helpful as was initially hoped. We also develop guidelines for making algorithm animations more useful in the future.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Ronald M. Baecker and David Sherman. Sorting Out Sorting. 16mm color sound film, 1981. Shown at SIGGRAPH '81, Dallas TX.
2
 
3
4
 
5
Marc H. Brown and Robert Sedgewick. Techniques for algorithm animation. IEEE Software, 2(1):28- 39, January 1985.
 
6
7
 
8
9
 
10
John T. Stasko and Carlton Reid Turner. Tidy animations of tree algorithms. In Proceedings of the IEEE 1992 Workshop on Visual Languages, pages 216-218, Seattle, WA, September 1992.
 
11
John T. Stasko and Carlton Reid Turner. Tidy animations of tree algorithms. Technical Report GIT- GVU-92-11, Graphics, Visualization, and Usability Center, Georgia Institute of Technology, Atlanta, GA, June 1992.
12
 
13
Roger E. Whitney and N. Scott Urquhart. Microcomputers in the mathematical sciences: Effects of courses, students, and instructors. Academic Compul,rtg, 4(6):14-18,49-53, March 1990.

CITED BY  37
 
 
 
 
 
 
 
 

Collaborative Colleagues:
John Stasko: colleagues
Albert Badre: colleagues
Clayton Lewis: colleagues