skip to main content
article
Free Access

Designing courseware on algorithms for active learning with virtual board games

Authors Info & Claims
Published:27 June 1999Publication History
Skip Abstract Section

Abstract

We present a method for designing courseware on algorithms for active learning with virtual board games. Our goal is to build algorithm courseware that integrates explanation with animation and makes the student an active participant. We give hints for structuring the material into sections and mixing presentation with exercises. We present our ideas for a new form of visual interactive exercise and a cardboard game prototype with which we tested our ideas.

References

  1. 1 Byme, M.D., Catrambone, R. and Stasko, J.T. Do Algorithm Animations Aid Learning? TR GIT-GVU-96-18, GVU, Georgia Institute of Technology, Atlanta, GA.Google ScholarGoogle Scholar
  2. 2 Cormen, T.H., Leiserson, C.E., Rivest, R.L. Introduction to Algorithms. 1990. MIT Press, Cambridge. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Eisenberg, M. The Thin Glass Line: Designing Interfaces to Algorithms. CHI 96 Conference Proceedings (1996). ACM Press, 181 - 188. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Gorny, P. Didaktisches Design telematik-gestuetzter Lernsoftware. In: Koerber, B. and Peters, I.-R. Informatische Bildung in Deutschland, Berlin 1998, LOG IN Verlag. 127-155. English pre-version: http://www-cghci.informatik.uni-oldenburg.de/resources/TET.pdfGoogle ScholarGoogle Scholar
  5. 5 Gloor, P., Dynes, S. and Lee, I. Animated Algorithms. CD-ROM. 1993. MIT Press.Google ScholarGoogle Scholar
  6. 6 Gloor, P. Elements of Hypermedia Design. 1997. Birkhaeuser. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Stasko, J., Domingue, J., Brown, M.H. and Price, B.A. (eds.): "Software Visualization". 1998. MIT Press.Google ScholarGoogle Scholar
  8. 8 Stasko, J. and Lawrence, A. Empirically Assessing Algorithm Animations as Learning Aids. In: {7} 419- 438.Google ScholarGoogle Scholar
  9. 9 Williams, J.W.J. Algorithm 232 (heapsort). Comm. of the ACM, 7:347-348, 1964.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Designing courseware on algorithms for active learning with virtual board games

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCSE Bulletin
        ACM SIGCSE Bulletin  Volume 31, Issue 3
        Sept. 1999
        212 pages
        ISSN:0097-8418
        DOI:10.1145/384267
        Issue’s Table of Contents
        • cover image ACM Conferences
          ITiCSE '99: Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education
          June 1999
          214 pages
          ISBN:1581130872
          DOI:10.1145/305786

        Copyright © 1999 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 27 June 1999

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader