ABSTRACT Effective Features of Algorithm Visualizations
BibTeX
@MISC{Saraiya_abstracteffective,
author = {Purvi Saraiya and Clifford A. Shaffer and D. Scott Mccrickard and Chris North},
title = {ABSTRACT Effective Features of Algorithm Visualizations},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Many algorithm visualizations have been created, but little is known about which features are most important to their success. We believe that pedagogically useful visualizations exhibit certain features that hold across a wide range of visualization styles and content. We began our efforts to identify these features with a review that attempted to identify an initial set of candidates. We then ran two experiments that attempted to identify the effectiveness for a subset of features from the list. We identified a small number of features for algorithm visualizations that seem to have a significant impact on their pedagogical effectiveness, and found that several others appear to have little impact. The single most important feature studied is the ability to directly control the pace of the visualization. An algorithm visualization having a minimum of distracting features, and which focuses on the logical steps of an algorithm, appears to be best for procedural understanding of the algorithm. Providing a good example for the visualization to operate on proved significantly more effective than letting students construct their own data sets. Finally, a pseudocode display, a series of questions to guide exploration of the algorithm, or the ability to back up within the visualization did not show a significant effect on learning.
Keyphrases
algorithm visualization abstract effective feature good example several others logical step useful visualization visualization style pseudocode display little impact data set significant impact wide range procedural understanding important feature initial set pedagogical effectiveness small number significant effect certain feature
