Review of animation systems understanding Temple University for algorithm Judith Wilson and Robert Aiken Irvin Katz [educational Testing Service Abstract We survey how several algorithm animation systorns are used in Computer Science instruction. Reported student reactions to the use of these systems is favorable, but little information is available on their effectiveness for learning. We examine several formal studies that have implications for how animation systems can most effectively be used to teach algorithms. animation systems that have been developed by instructors for use in their classes are described in the literature. However, detailed information about how these visualization systems are used in instruction is difficult to find. Following are several examples. 2.1 Balsa 1 Introduction Recently, a great deal of time and resources have been devoted to developing animation systems for teaching Computer Science (CS) algorithms [13, 3]. Animations of an algorithm s execution typically include dynamic visualizations of its changing data structures during execution or of its behavior in a microworld (e. g., the progression of a search algorithm as it solves a search problem defined on a map of cities). These systems provide students with concrete, often interactive, environments in which they can explore the
/lp/association-for-computing-machinery/review-of-animation-systems-for-algorithm-understanding-pS22H3EGiH