A modular approach to program visualization in computer science instruction

Authors:
Don C. Stone
Affiliations:
Department of Mathematics and Computer Science, Glassboro State College, Glassboro, NJ
Venue:
SIGCSE '87 Proceedings of the eighteenth SIGCSE technical symposium on Computer science education
Year:
1987

Citing 4
Cited 0

Graphic displays of data structures on the IBM PC

SIGCSE '86 Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
Visual programming, programming by example, and program visualization: a taxonomy

CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A cognitive approach to software development: the PRODOC environment and associated methodology

Journal of Pascal, Ada & Modula-2
Real-time graphical representation of linked data structures

SIGCSE '85 Proceedings of the sixteenth SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

The approach to program visualization in computer science instruction discussed here has two components: the graphic display of algorithms and the graphic display of their execution. Both types of display are based on the same hierarchical representation of an algorithm (in terms of Scandura FLOWforms, an enhancement and generalization of Nassi-Shneiderman diagrams). The execution display is obtained by the addition of explicit display commands to the basic algorithm, but the execution display details can be largely suppressed when the algorithm itself is being displayed. Two major characteristics of this approach are the modularity and the easy modifiability of demonstration procedures. The hardware required is an IBM PC or AT or compatible.