• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Visual algorithm simulation. (2003)

by Ari Korhonen
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 16
Next 10 →

Kimmo St˚ alnacke. MatrixPro - a tool for demonstrating data structures and algorithms ex tempore

by Ville Karavirta, Ari Korhonen, Lauri Malmi - In Proceedings of the 4th IEEE International Conference on Advanced Learning Technologies , 2004
"... Algorithm animation has been researched since early 1980’s and many different visualization systems have been developed. However, most of them have remained as research prototypes and almost none have gained wide acceptance by teachers as classroom demonstration tools. One of the key reasons for thi ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Algorithm animation has been researched since early 1980’s and many different visualization systems have been developed. However, most of them have remained as research prototypes and almost none have gained wide acceptance by teachers as classroom demonstration tools. One of the key reasons for this has been that preparing animations has been too laborious. In this paper, we demonstrate a new tool, MatrixPro, in which animations are generated in terms of visual algorithm simulation. The user can graphically invoke ready-made operations available in the library to simulate the working of real algorithms. Since the system understands the semantics of the operations, the teacher can ex tempore demonstrate the execution of algorithms with different input sets, or work with ”what-if ” questions students ask in lectures. Such an approach lowers considerably the step for adopting algorithm visualization as a regular lecture tool. 1.
(Show Context)

Citation Context

... Or, the material must be prepared beforehand – at least to some extent. Thus, very few systems support the demonstration ex tempore. The new tool called MatrixPro applies visual algorithm simulation =-=[4]-=- to aid the development of illustrative material for a data structures and algorithms course. Visual algorithm simulation is a generalization of algorithm animation in the sense that it allows real in...

Matrix -- A Framework for Interactive Software Visualization

by Ari Korhonen, Lauri Malmi, Panu Silvasti, Ville Karavirta, Jan Lönnberg, Jussi Nikander, Kimmo Stålnacke, Petri Tenhunen , 2004
"... ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract not found

Enhancing Learning Management Systems to Better Support Computer Science Education A report of the Working Group on Design Patterns for Online Learning Environments in Computer Science

by Tu Darmstadt, Mike Joy, Andrés Moreno, Atanas Radenski, Andreas Kerren, Thomas Naps, Rockford J. Ross, Michael Clancy, Ari Korhonen
"... Many individual instructors—and, in some cases, entire universities—are gravitating towards the use of comprehensive learning management systems (LMSs), such as Blackboard and Moodle, for managing courses and enhancing student learning. As useful as LMSs are, they are short on features that meet cer ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Many individual instructors—and, in some cases, entire universities—are gravitating towards the use of comprehensive learning management systems (LMSs), such as Blackboard and Moodle, for managing courses and enhancing student learning. As useful as LMSs are, they are short on features that meet certain needs specific to computer science education. On the other hand, computer science educators have developed—and continue to develop—computer-based software tools that aid in management, teaching, and/or learning in computer science courses. In this report we provide an overview of current CS specific on-line learning resources and guidance on how one might best go about extending an LMS to include such tools and resources. We refer to an LMS that is extended specifically for computer science education as a Computing Augmented Learning Management
(Show Context)

Citation Context

...built-in generators [122]. Each approach except for the first can be used to automate the generation of animation content. MatrixPro takes a different approach in terms of visual algorithm simulation =-=[71]-=- for the rapid creation of algorithm visualizations and animations. The same technique is utilized in TRAKLA2 exercises. The focus of MatrixPro lies in portraying and manipulating algorithms and data ...

Examensarbete 15 hp Snapshot Algorithm Animation with Erlang

by Fredrik Bryntesson
"... ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...f there was some method to visualize an algorithm like Snapshot that was superior to all other visualization methods and gave the user a larger sense of understanding the visualization than other methods did. Did it exist any research about visualization in computer science education and could this research provide some good ideas about the visualization design and explain the important characteristics of making an algorithm visualization. 3.1.1 Algorithm Visualization and Teaching Ari Korhonen did research about visualization of algorithms in his doctoral thesis “Visual Algorithm Simulation” [10]. He describes methods of providing visualization to make abstracts concepts like complex algorithms and data structures more concrete and easier to understand. Korhonen have developed the Matrix application framework that does two things; first it visualizes fundamental computer algorithms, this is algorithm animation, and secondly, it provides a framework for exploring and understanding data structures and algorithms. He presents two different methods of visualization: 1. Static algorithm visualization - A set of images of each the steps of an algorithm execution is displayed. 2. Dynamic alg...

HELSINKI UNIVERSITY ABSTRACT OF THE

by Ville Karavirta , 2005
"... Algorithm visualization aims to aid the human understanding of a high-level representation of a piece of code. Algorithm animation (AA) is a dynamic algorithm visualization where the dynamic behavior can range from a series of static pictures to an animation requiring interaction from the user. Unti ..."
Abstract - Add to MetaCart
Algorithm visualization aims to aid the human understanding of a high-level representation of a piece of code. Algorithm animation (AA) is a dynamic algorithm visualization where the dynamic behavior can range from a series of static pictures to an animation requiring interaction from the user. Until now, many systems supporting the usage of algorithm animation have been developed. These systems all provide different means to create the animations. Data exchange between the different systems would allow the usage of different tools in different phases of the AA production. However, up to the present the data exchange possibilities have been minimal. In this work, we survey a number of algorithm animation systems and the algorithm animation languages they use to describe the animations. We concentrate on systems targeted for educational use. Based on this analysis, we specify a taxonomy to evaluate algorithm animation languages. We then use the taxonomy to combine the required features of a language that can be used as an intermediate language when exchanging data between algorithm animation
(Show Context)

Citation Context

...tem that uses this approach is BALSA [13]. Another style is direct manipulation [50]. In direct manipulation, the animation is specified by manipulating graphical objects. Visual algorithm simulation =-=[31]-=- takes direct manipulation one step further by allowing the animation to be specified manipulating concrete data structures through visualizations. Automatic animation is also a popular style due to i...

Jan Lönnberg Visual testing of software

by Jan Lönnberg, Supervisor Lauri Malmi, Instructor Ari Korhonen, Pääaine Ohjelmistojärjestelmät
"... Software development is prone to time-consuming and expensive errors. Finding and correcting errors in a program (debugging) is usually done by executing the program with different inputs and examining its intermediate and/or final results (testing). The tools that are currently available for debugg ..."
Abstract - Add to MetaCart
Software development is prone to time-consuming and expensive errors. Finding and correcting errors in a program (debugging) is usually done by executing the program with different inputs and examining its intermediate and/or final results (testing). The tools that are currently available for debugging (debuggers) do not fully make use of potentially useful visualisation and interaction techniques. This thesis presents a new interactive graphical software testing methodology called visual testing. A programmer can use a visual testing tool to examine and manipulate a running program and its data structures. Systems with techniques applicable to visual testing in the related domains of debugging, software visualisation and algorithm animation are surveyed. Techniques that are potentially useful to visual testing are described, examined and evaluated, and a design for a visual testing tool based on these techniques is presented. The tool combines aspects of user-controlled algorithm simulation, high-level data visualisation and visual debugging, and allows easier testing, debugging and understanding of software. A prototype visual testing tool is presented and evaluated here as a proof of concept for some of the aspects of visual testing. Finally, some suggestions for future research in visual testing are presented.
(Show Context)

Citation Context

...M that executes bytecode, as defined in [36]. Bytecode is usually generated by compiling programs written in Java, which is defined in [21]. • Data types (defined more precisely and in more detail in =-=[30]-=-): ADT (Abstract Data Type) A set of operations with defined semantics. This corresponds roughly to the specification of an interface in an object-oriented program. CDT (Conceptual Data Type) An imple...

26 Third Program Visualization Workshop MatrixPro – A Tool for On-The-Fly Demonstration of Data Structures and Algorithms

by Ville Karavirta, Ari Korhonen, Lauri Malmi
"... In this paper, we introduce a new tool, MatrixPro, intended for illustrating algorithms in action. One can produce algorithm animations in terms of direct manipulation of the library data structures, the process we call visual algorithm simulation. The user does not need to code anything to build an ..."
Abstract - Add to MetaCart
In this paper, we introduce a new tool, MatrixPro, intended for illustrating algorithms in action. One can produce algorithm animations in terms of direct manipulation of the library data structures, the process we call visual algorithm simulation. The user does not need to code anything to build animations. Instead, he or she can graphically invoke ready-made operations available in the library data structures to simulate the working of real algorithms. Since the system understands the semantics of the operations, teachers can demonstrate the execution of algorithms on-the-fly with different input sets, or work with ”what-if ” questions students ask in lectures. Such an approach lowers considerably the step to adopt algorithm visualization for regular lecture practice. 1
(Show Context)

Citation Context

..., the material must be prepared beforehand – at least to some extent. Thus, very few systems support the demonstration on-the-fly. In this paper, we describe how to apply visual algorithm simulation (=-=Korhonen, 2003-=-) to aid the development of illustrative material for a data structures and algorithms course. Visual algorithm simulation is a generalization of algorithm animation in the sense that it allows real i...

ABSTRACT Taxonomy of Effortless Creation of Algorithm

by Petri Ihantola, Ville Karavirta, Ari Korhonen, Jussi Nik
"... The idea of using visualization technology to enhance the understanding of abstract concepts, like data structures and algorithms, has become widely accepted. Several attempts have been made to introduce a system that levels out the burden of creating new visualizations. However, one of the main obs ..."
Abstract - Add to MetaCart
The idea of using visualization technology to enhance the understanding of abstract concepts, like data structures and algorithms, has become widely accepted. Several attempts have been made to introduce a system that levels out the burden of creating new visualizations. However, one of the main obstacles to fully taking advantage of algorithm visualization seems to be the time and effort required to design, integrate and maintain the visualizations. Effortlessness in the context of algorithm visualization is a highly subjective matter including many factors. Thus, we first introduce a taxonomy to characterize effortlessness in algorithm visualization systems. We have identified three main categories based on a survey conducted among CS educators: i) scope, i.e. how wide is the context one can apply the system to ii) integrability, i.e., how easy it is to take in use by a third party, and iii) interaction techniques, i.e., how well does the system support different use cases regularly applied by educators. We will conclude that generic and effortless visualization systems are needed. Such a system, however, needs to combine a range of characteristics implemented in many current AV systems.
(Show Context)

Citation Context

...rixPro, animations are created by dragging and dropping elements in the view. The elements can be, for example, keys, references or data structures. This process is called visual algorithm simulation =-=[15]-=-. From the visualizations, it is possible to call functionality of the underlying data structure. For example, a set of keys can be inserted each at a time into an initially empty B–tree (e.g. draggin...

118 Third Program Visualization Workshop Taxonomy of Visual Algorithm Simulation Exercises

by Ari Korhonen, Lauri Malmi
"... This paper presents a taxonomy for algorithm simulation exercises that allow to build learning environments that not only portray a variety of algorithms and data structures, but also distribute tracing exercises to the student and then automatically evaluates his/her answer to the exercises. The ta ..."
Abstract - Add to MetaCart
This paper presents a taxonomy for algorithm simulation exercises that allow to build learning environments that not only portray a variety of algorithms and data structures, but also distribute tracing exercises to the student and then automatically evaluates his/her answer to the exercises. The taxonomy systematically classifies the exercises into 8 separate categories that have 8 subcategories each. Each category is characterized and demonstrated by describing an example exercise that falls in the category. The taxonomy provides a thinking tool to systematically diversify the set of possible simulation exercises. Thus, the taxonomy promotes new perspectives to come up with novel exercises of completely new genre. Moreover, we demonstrate a fully working web based learning environment that already includes implementations for such exercises. 1
(Show Context)

Citation Context

... data structures, but also distribute tracing exercises to the student and then evaluate his/her answer to the exercises. One possible method for building such systems is visual algorithm simulation (=-=Korhonen, 2003-=-), which allows to practise, for example, such core CS topics as sorting algorithms, search trees, priority queues, and graph algorithms on a conceptual level without writing any code. When automatic ...

ABSTRACT MVT — A system for visual testing of software

by unknown authors
"... Software development is prone to time-consuming and expensive errors. Finding and correcting errors in a program (debugging) is usually done by executing the program with different inputs and examining its intermediate and/or final results (testing). The tools that are currently available for debugg ..."
Abstract - Add to MetaCart
Software development is prone to time-consuming and expensive errors. Finding and correcting errors in a program (debugging) is usually done by executing the program with different inputs and examining its intermediate and/or final results (testing). The tools that are currently available for debugging (debuggers) do not fully make use of several potentially useful visualisation and interaction techniques. This article presents a prototype debugging tool (MVT — Matrix Visual Tester) based on a new interactive graphical software testing methodology called visual testing. A programmer can use a visual testing tool to examine and manipulate a running program and its data structures. The tool combines aspects of visual algorithm simulation, high-level data visualisation and visual debugging, and allows easier testing, debugging and understanding of software.
(Show Context)

Citation Context

...h the states of the data structure and algorithm to study the progress of the algorithm [1]. Visual algorithm simulation, however, gives the user the ability to manipulate the data structures himself =-=[7]-=-. Most algorithm animation and simulation tools are designed for the teaching of algorithms and data structures. Their purpose is twofold: to make it easier for teachers to show their students what an...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University