Zusammenfassung
Wir berichten über unsere Erfahrungen, die wir mit der Entwicklung eines interaktiven Hypertextes zur Einführung in die Theoretische Informatik gemacht haben. Wir legen kurz unsere Ansätze dar, Simulationen in diesen Hypertext zu integrieren und gehen ausführlicher auf eine Visualisierung des in der Grundausbildung vermittelten Cocke-Kasami-Younger Algorithmus ein.
Abstract
We report on our experiences with the development of an interactive hypertext for teaching theoretical computer science. We briefly expose the integration of simulations into the hypertext and demonstrate more elaborately a visualization of the Cocke-Kasami-Younger algorithm that is part of our undergraduate curriculum.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
Barwise, J. und J. Etchemendy: Turing’s World 3.0. Windows Version. CSLI Lecture Notes. Cambridge University Press, 1997.
Bergin, J., K. Brodilie, M. Goldweber, R. Jiménez-Peris, S. Khuri, M. Pa-tiño-Matínez, M. McNally, T. Naps, S. Rodger und J. Wilson: An overview of visualization: its use and design. Report of the Working Group on Visualization. SIGCSE Bulletin, 28:192–200, 1996.
Bilska, A. O., K. H. Leidger, M. Procopiuc, O. Procopiuc, S. Rodger, J. R. Salemme und E. Tsang: A Collection of Tools for Making Automata Theory and Formal Languages Come Alive. In: SIGCSE’97, S. 15–19, 1997.
Brown, M. H.: Algorithm Animation. MIT Press, Cambridge, 1988.
Moll, R. A., A. J. Kfoury und M. A. Arbib: An Introduction to Formal Language Theory. Texts and Monographs in Computer Science. Springer-Verlag, 1988.
Pape, C.: Using Interactive Visualization for Teaching the Theory of NP-completeness. Techn. Ber. 30, Universität Karlsruhe, 1997.
Pape, C. und P.H. Schmitt: Visualizations for Proof Presentation in Theoretical Computer Science Education. In: Halim, Z., T. Ottmann und Z. Razak (Hrsg.): Proceedings of International Conference on Computers in Education, Kuching, Sarawak, Malaysia, December 2–6, S. 229–236. Association for the Advancement of Computing in Education, 1997.
Post, E.: A variant of a recursivley unsolvable problem. Bulletin of the American Mathematical Society, 53:264–268, 1946.
Rodger, S.: An Interactive Lecture Approach to Teaching Computer Science. In: SIGCSE’95, S. 278–282, 1995.
Stasko, J., A. Badre und C. Lewis: Do Algorithm Animations Assist Learning? An Empirical Study and Analysis. In: Proceedings of ACM Int. Conference on Human Factors in Computing Systems, Understanding Programming, S. 61–66, 1993.
Turing, A. M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Mathematical Society, 42:230–265, 1936.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pape, C., Schmitt, P. (1998). Interaktive Visualisierungen in der Lehre der Theoretische Informatik. In: Claus, V. (eds) Informatik und Ausbildung. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72169-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-72169-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64178-0
Online ISBN: 978-3-642-72169-4
eBook Packages: Springer Book Archive