39 research outputs found

    Proceedings of the Third Symposium on Programming Languages and Software Tools : Kääriku, Estonia, August 23-24 1993

    Get PDF
    http://www.ester.ee/record=b1064507*es

    Knowledge Testing in Algorithms – an Experimental Study

    Get PDF
    With the appearance of INTERNET technologies the developers of algorithm animation systems have shifted to build on-line system with the advantages of platform-independence and open accessibility over earlier ones. As a result, there is ongoing research in the re-design and re-evaluation of AAS in order to transform them in task-oriented environments for design of algorithms in on-line mode. The experimental study reported in the present paper contributes in this research

    CHR^vis: Syntax and Semantics

    Get PDF
    The work in the paper presents an animation extension (CHR^{vis}) to Constraint Handling Rules (CHR). Visualizations have always helped programmers understand data and debug programs. A picture is worth a thousand words. It can help identify where a problem is or show how something works. It can even illustrate a relation that was not clear otherwise. CHR^{vis} aims at embedding animation and visualization features into CHR programs. It thus enables users, while executing programs, to have such executions animated. The paper aims at providing the operational semantics for CHR^{vis}. The correctness of CHR^{vis} programs is also discussed

    Developing Collective Teaching Computer Software for the Course “Decision Theory”

    Get PDF
    Improvement of training students using modern information technologies, like collective developing teaching computer software, is discussed. Organizational, technical, technological advices are given. Experience of using information technologies in educational course “Decision Theory” is described

    Development and testing of a graphical FORTRAN learning tool for novice programmers

    Get PDF
    To address the difficulties associated with computer programming, this article first looks at some reasons why students, especially engineering students, find programming such a daunting prospect, and it proposes a programming learning tool managed by a Deterministic Finite Automaton (DFA). The DFA machine used a graphical environment provided by Simulink to teach the FOR-mula TRANslator (FORTRAN) programming language to science students. The proposed programming learning tool and the traditional method of teaching were compared and evaluated. The results of evaluation indicated that there was an improvement in learning effectiveness of the proposed learning tool

    Task-centered user interface design of an algorithm animation program

    Get PDF

    An initial evaluation of MathPad(2): A tool for creating dynamic mathematical illustrations

    Get PDF
    MathPad(2) is a pen-based application prototype for creating mathematical sketches. Using a modeless gestural interface, it lets users make dynamic illustrations by associating handwritten mathematics with free-form drawings and provides a set of tools for graphing and evaluating mathematical expressions and solving equations. In this paper, we present the results of an initial evaluation of the MathPad(2) prototype, examining the user interface\u27s intuitiveness and the application\u27s perceived usefulness. Our evaluations are based on both performance and questionnaire results including first attempt gesture performance, interface recall tests, and surveys of user interface satisfaction and perceived usefulness. The results of our evaluation suggest that, although some test subjects had difficulty with our mathematical expression recognizer, they found the interface, in general, intuitive and easy to remember. More importantly, these results suggest the prototype has the potential to assist beginning physics and mathematics students in problem solving and understanding scientific concepts. (c) 2007 Elsevier Ltd. All rights reserved

    Semi-automatic generation of three-dimensional visual algorithm simulations

    Get PDF
    Algorithms and data structures constitute the theoretical foundations of computer science and are an integral part of any classical computer science curriculum. Due to their high level of abstraction, the understanding of algorithms is of crucial concern to the vast majority of novice students. To facilitate the understanding and teaching of algorithms, a new research field termed "algorithm visualisation" evolved in the early 1980's. This field is concerned with innovating techniques and concepts for the development of effective algorithm visualisations for teaching, study, and research purposes. Due to the large number of requirements that high-quality algorithm visualisations need to meet, developing and deploying effective algorithm visualisations from scratch is often deemed to be an arduous, time-consuming task, which necessitates high-level skills in didactics, design, programming and evaluation. A substantial part of this thesis is devoted to the problems and solutions related to the automation of three-dimensional visual simulation of algorithms. The scientific contribution of the research presented in this work lies in addressing three concerns: - Identifying and investigating the issues related to the full automation of visual simulations. - Developing an automation-based approach to minimising the effort required for creating effective visual simulations. - Designing and implementing a rich environment for the visualisation of arbitrary algorithms and data structures in 3D. The presented research in this thesis is of considerable interest to (1) researchers anxious to facilitate the development process of algorithm visualisations, (2) educators concerned with adopting algorithm visualisations as a teaching aid and (3) students interested in developing their own algorithm animations.Als fundamentale abstrakte Konzepte der theoretischen Informatik sind Algorithmen und Datenstrukturen ein integraler Bestandteil jedes klassischen Kurrikulums eines Informatik-Studiums. Aufgrund ihrer abstrakten Eigenschaften stellt das Verstehen der Arbeitsweise von Algorithmen für viele Studierende eine große Herausforderung dar. Um das Lernen, Lehren und Erforschen von Algorithmen und Datenstrukturen zu vereinfachen, wurde Anfang der 80er Jahre ein Forschungsgebiet namens Algorithmenvisualisierung geschaffen. Als Teildisziplin der Softwarevisualisierung befasst sich dieses Forschungsfeld mit der dynamischen Visualisierung des abstrakten Verhaltens von Algorithmen und den diesen zugrundeliegenden Datenstrukturen. Algorithmenvisualisierung gilt als ein modernes e-Learning- und e-Teaching-Instrument, das Computergraphiktechniken einsetzt, um das Verstehen, Vermitteln und Erforschen von Algorithmen zu erleichtern. Ein Hauptziel dieser Dissertation besteht darin, Ansätze zur Automatisierung von dreidimensionalen visuellen Algorithmensimulationen zu entwickeln und zu implementieren. Eine visuelle Simulation eines Algorithmus ist eine interaktive Animation seines Verhaltens und der Zustandsänderungen seiner Daten, der eine Echtzeitsimulation des Algorithmus zugrunde liegt. Der wissenschaftliche Beitrag dieser Arbeit besteht darin, die bislang unerforschten Probleme der vollautomatischen Visualisierung von Algorithmen zu identifizieren und zu analysieren, mögliche Lösungswege und -ansätze zu entwickeln und diese in eine zu schaffende Algorithmenvisualisierungsumgebung zu implementieren. Desweiteren präsentiert die Arbeit einen Ansatz zur Minimierung des Aufwands für die Entwicklung von visuellen Simulationen paralleler Algorithmen und einen Ansatz zur passiven Animation von Algorithmen zu NP-vollständigen Problemen. ..
    corecore