skip to main content
10.1145/2094131.2094157acmotherconferencesArticle/Chapter ViewAbstractPublication Pageskoli-callingConference Proceedingsconference-collections
research-article

Card games for teaching data structures and algorithms

Published:17 November 2011Publication History

ABSTRACT

Data structures and algorithms have many elements and rules that can be used to design educational games. Many of the games used in education are played with a computer. However, cards games can also be used to teach students algorithms and to encourage them to discuss the issues faced during the games.

This poster presents two card games that were used on a Data Structures and Algorithms course in Aalto University. They consider sorting algorithms and concepts related to them. The fundamental idea of the games is to raise questions that the players need to find answers to, rather than to provide direct answers to the players.

References

  1. T. Bell, I. Witten, and M. Fellows. Computer Science Unplugged: Off-line Activities and Games for All Ages. Citeseer, 1998.Google ScholarGoogle Scholar
  2. L. Hakulinen. Using serious games in computer science education. In Proceedings of the 11th Koli Calling International Conference on Computing Education Research, To appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Hamey. Teaching secure communication protocols using a game representation. In Proceedings of the fifth Australasian conference on Computing education, pages 187--196. Citeseer, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Shabanah, J. Chen, H. Wechsler, D. Carr, and E. Wegman. Designing computer games to teach algorithms. In 2010 Seventh International Conference on Information Technology, pages 1119--1126. IEEE, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Wallace, R. McCartney, and I. Russell. Games and machine learning: a powerful combination in an artificial intelligence course. Computer Science Education, 20(1):17--36, 2010.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Card games for teaching data structures and algorithms

    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
    • Published in

      cover image ACM Other conferences
      Koli Calling '11: Proceedings of the 11th Koli Calling International Conference on Computing Education Research
      November 2011
      149 pages
      ISBN:9781450310529
      DOI:10.1145/2094131

      Copyright © 2011 Copyright is held by the owner/author(s)

      Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 17 November 2011

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate80of182submissions,44%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader