Abstract
Computer science educators have traditionally used algorithm visualization (AV) software to create graphical representations of algorithms that are later used as visual aids in lectures, or as the basis for interactive labs. Typically, such visualizations are high fidelity in the sense that (a) they depict the target algorithm for arbitrary input, and (b) they tend to have the polished look of textbook figures. In contrast, low fidelity visualizations illustrate the target algorithm for a few, carefully chosen input data sets, and tend to have a sketched, unpolished appearance. Drawing on the findings of ethnographic studies we conducted in a junior-level algorithms course, we motivate the use of low fidelity AV technology as the basis for an alternative learning paradigm in which students construct and present their own visualizations. To explore the design space of low fidelity AV technology, we present a prototype language and system derived from empirical studies in which students constructed and presented visualizations made out of simple art supplies. Our prototype language and system pioneer a novel technique for programming visualizations based on spatial relations, and a novel presentation interface that supports reverse execution and dynamic mark-up and modification
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. H. Brown, Algorithm animation. Cambridge, MA: The MIT Press, 1988.
J. Stasko, “Tango: A framework and system for algorithm animation.” Ph.D. Dissertation (Tech. Rep. No. CS-89-30), Department of Computer Science, Brown University, Providence, RI, 1989.
T. Naps, “Algorithm visualization in computer science laboratories,” in Proceedings of the 21st SIGCSE Technical Symposium on Computer Science Education. New York: ACM Press, 1990, pp. 105–110.
G. C. Roman, K. C. Cox, C. D. Wilcox, and J. Y. Plun, “Pavane: A system for declarative visualization of concurrent computations,” Journal of visual languages and computing, vol. 3, pp. 161–193, 1992.
J. T. Stasko, “Using student-built animations as learning aids,” in Proceedings of the ACM Technical Symposium on Computer Science Education. New York: ACM Press, 1997, pp. 25–29.
M. H. Brown and R. Sedgewick, “Progress report: Brown University Instructional Computing Laboratory,” in ACM SIGCSE Bulletin, vol. 16, pp. 91–101, 1984.
J. Lave and E. Wenger, Situated Learning: Legitimate Peripheral Participation. New York: Cambridge U. Press, 1991.
C. D. Hundhausen, “Toward Effective Algorithm Visualization Artifacts: Designing for Participation and Communication in an Undergraduate Algorithms Course.” Ph.D. Dissertation (Tech. Rep. No. CIS-99-07), Department of Computer and Info. Science, University of Oregon, Eugene, 1999. Available at http://lilt.ics.hawaii.edu/~hundhaus/dis/.
S. A. Douglas, C. D. Hundhausen, and D. McKeown, “Toward empirically-based software visualization languages,” in Proceedings of the 11th IEEE Symposium on Visual Languages. Los Alamitos, CA: IEEE Computer Society Press, 1995, pp. 342–349.
S. A. Douglas, C. D. Hundhausen, and D. McKeown, “Exploring human visualization of computer algorithms,” in Proceedings 1996 Graphics Interface Conference. Toronto, CA: Canadian Graphics Society, 1996, pp. 9–16.
M. van de Kant, S. Wilson, M. Bekker, H. Johnson, and P. Johnson, “PatchWork: A software tool for early design,” in Human Factors in Computing Systems: CHI 98 Summary. New York: ACM Press, 1998, pp. 221–222.
G. C. Roman and K. C. Cox, “A taxonomy of program visualization systems,” IEEE Computer, vol. 26, pp. 11–24, 1993.
A. Michail, “Teaching binary tree algorithms through visual programming,” in Proceedings of the 12th IEEE Symposium on Visual Languages. Los Alamitos, CA: IEEE Computer Society Press, 1996, pp. 38–45.
D. R. Brown and B. Vander Zanden, “The Whiteboard environment: An electronic sketchpad for data structure design and algorithm description,” in Proceedings of the 1998 IEEE Symposium on Visual Languages. Los Alamitos, CA: IEEE Computer Society Press, 1998, pp. 288–295.
W. Citrin and J. Gurka, “A low-overhead technique for dynamic blackboarding using morphing technology,” Computers and Education, pp. 189–196, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hundhausen, C., Douglas, S. (2002). A Language and System for Constructing and Presenting Low Fidelity Algorithm Visualizations. In: Diehl, S. (eds) Software Visualization. Lecture Notes in Computer Science, vol 2269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45875-1_18
Download citation
DOI: https://doi.org/10.1007/3-540-45875-1_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43323-1
Online ISBN: 978-3-540-45875-3
eBook Packages: Springer Book Archive