More Web Proxy on the site http://driver.im/

Article

Using puzzles in teaching algorithms

Authors:

Mary-Angela PapalaskariAuthors Info & Claims

SIGCSE '02: Proceedings of the 33rd SIGCSE technical symposium on Computer science education

Pages 292 - 296

https://doi.org/10.1145/563340.563456

Published: 27 February 2002 Publication History

Abstract

This paper advocates a wider use of puzzles and puzzle-like problems in teaching design and analysis of algorithms. It discusses a variety of puzzles and classifies them according to the general algorithm design techniques. Pedagogic issues are explored.

References

[1]

Bellman, R. E. and Dreyfus, S. E. Applied Dynamic Programming. Princeton University Press, 1962.]]

Digital Library

[2]

Bentley, J. Programming Pearls. 2nd ed., Addison-Wesley, 2000.]]

Digital Library

[3]

Brassard, G. and Bratley, P. Fundamentals of Algorithmics. Prentice-Hall, 1996.]]

Digital Library

[4]

Dewdney, A. K. The (New) Turing Omnibus: 66 Excursions in Computer Science. Computer Science Press, 1992.]]

Digital Library

[5]

Gardner, M. My Best Mathematical and Logical Puzzles. Dover, 1994.]]

[6]

Graham, R. L., Knuth, D. E., and Potashnik, O. Concrete Mathematics. Addison-Wesley, 1998.]]

Digital Library

[7]

Horowitz, E., Sahni, S., and Rajasekaran, S. Computer Algorithms. Computer Science Press, New York, 1996.]]

Digital Library

[8]

Kordemsky, B. The Moscow Puzzles: 359 Mathematical Recreations. Dover, 1992.]]

[9]

Knuth, D. E. The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd ed., Addison-Wesley, 1997.]]

Digital Library

[10]

Levitin, A. Do we teach the right algorithm design techniques? in Proceedings of SIGCSE '99 (March 1999), 179-183.]]

Digital Library

[11]

Levitin, A. Introduction to Design and Analysis of Algorithms. Addison-Wesley, 2002 (to appear).]]

Digital Library

[12]

Neapolitan, R. E. and Naimipour, K. Foundations of Algorithms. Jones and Bartlett Publishers, 1996.]]

Digital Library

[13]

Parberry, I. Problems on Algorithms. Prentice-Hall, 1995.]]

Digital Library

[14]

Parberry, I. A real-time algorithm for the (n2 - 1)-puzzle. Information Processing Letters 56 (1995), 23-28.]]

Digital Library

[15]

Parberry, I. An efficient algorithm for the knight's tour problem. Discrete Applied Mathematics 73 (1997), 251-260.]]

Digital Library

[16]

Rawlins, G. J. E. Compared to What? An Introduction to the Analysis of Algorithms. Computer Science Press, 1991.]]

Digital Library

[17]

Reingold, E. M., Nievergelt, J., and Deo, N. Combinatorial Algorithms: Theory and Practice. Prentice-Hall, 1977.]]

Digital Library

[18]

Russell, S. and Norvig, P. Artificial Intelligence: A Modern Approach. 2nd ed., Prentice-Hall, 2001.]]

Digital Library

[19]

Shasha, D. E. Codes, Puzzles, and Conspiracy. W.H. Freeman and Co., 1992.]]

[20]

Shasha, D. E. The Puzzling Adventures of Doctor Ecco. Dover, 1998.]]

[21]

Shasha, D. E. "Dr. Ecco's Omniheurist Corner," the column in the Dr. Dobb's Journal.]]

Digital Library

[22]

Shasha, D. E. "Puzzling Adventures," the column in the Scientific American.]]

Cited By

Choppella VViswanath KKumar M(2021)Algodynamics: Algorithms as systems2021 IEEE Frontiers in Education Conference (FIE)10.1109/FIE49875.2021.9637441(1-9)Online publication date: 13-Oct-2021
https://dl.acm.org/doi/10.1109/FIE49875.2021.9637441
Moser LSaner KOggier VHanne T(2021)A Serious Game for Teaching Genetic AlgorithmsProceedings of the Future Technologies Conference (FTC) 2021, Volume 310.1007/978-3-030-89912-7_57(738-758)Online publication date: 25-Oct-2021
https://doi.org/10.1007/978-3-030-89912-7_57
Doukakis SPapalaskari M(2019)Scaffolding Technological Pedagogical Content Knowledge (TPACK) in Computer Science Education through Learning Activity Creation2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)10.1109/SEEDA-CECNSM.2019.8908467(1-5)Online publication date: Sep-2019
https://doi.org/10.1109/SEEDA-CECNSM.2019.8908467
Show More Cited By

Using puzzles in teaching algorithms
1. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Computing education programs
2. Theory of computation

Recommendations

Using puzzles in teaching algorithms
Inroads: paving the way towards excellence in computing education

This paper advocates a wider use of puzzles and puzzle-like problems in teaching design and analysis of algorithms. It discusses a variety of puzzles and classifies them according to the general algorithm design techniques. Pedagogic issues are ...
Teaching Advanced Features of Evolutionary Algorithms Using Japanese Puzzles

In this paper, a method to teach advanced features of evolutionary algorithms (EAs), using a famous game known as Japanese puzzles is presented. The authors show that Japanese puzzles are constrained combinatorial optimization problems, that can be ...
No easy puzzles

We model jigsaw puzzle solving and study the number of edge matchings required.Realistic jigsaw puzzles require ( n 2 ) comparisons in the worst case.Realistic jigsaw puzzles require ( n 2 ) comparisons on average.Generalised puzzles require (tightly) O ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCSE '02: Proceedings of the 33rd SIGCSE technical symposium on Computer science education

February 2002

471 pages

ISBN:1581134738

DOI:10.1145/563340

Conference Chairs:
Judith Gersting
University of Hawaii at Hilo
,
Henry M. Walker
Grinnell College
,
Program Chair:
Scott Grissom
Grand Valley State University

ACM SIGCSE Bulletin Volume 34, Issue 1
Inroads: paving the way towards excellence in computing education
March 2002
417 pages
ISSN:0097-8418
DOI:10.1145/563517
Issue’s Table of Contents

Copyright © 2002 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]

Sponsors

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCSE02

Sponsor:

SIGCSE

SIGCSE02: The 33rd Technical Symposium on Computer Science Education

February 27 - March 3, 2002

Kentucky, Cincinnati

Acceptance Rates

SIGCSE '02 Paper Acceptance Rate 73 of 234 submissions, 31%;

Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

Upcoming Conference

SIGCSE TS 2025

Sponsor:
sigcse

The 56th ACM Technical Symposium on Computer Science Education

February 26 - March 1, 2025

Pittsburgh , PA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
2,722
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)2

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Choppella VViswanath KKumar M(2021)Algodynamics: Algorithms as systems2021 IEEE Frontiers in Education Conference (FIE)10.1109/FIE49875.2021.9637441(1-9)Online publication date: 13-Oct-2021
https://dl.acm.org/doi/10.1109/FIE49875.2021.9637441
Moser LSaner KOggier VHanne T(2021)A Serious Game for Teaching Genetic AlgorithmsProceedings of the Future Technologies Conference (FTC) 2021, Volume 310.1007/978-3-030-89912-7_57(738-758)Online publication date: 25-Oct-2021
https://doi.org/10.1007/978-3-030-89912-7_57
Doukakis SPapalaskari M(2019)Scaffolding Technological Pedagogical Content Knowledge (TPACK) in Computer Science Education through Learning Activity Creation2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)10.1109/SEEDA-CECNSM.2019.8908467(1-5)Online publication date: Sep-2019
https://doi.org/10.1109/SEEDA-CECNSM.2019.8908467
Parhami B(2018)Use of Logical Puzzles to Promote Techeracy for Non-Science/Engineering Students2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)10.1109/IEMCON.2018.8615098(155-159)Online publication date: Nov-2018
https://doi.org/10.1109/IEMCON.2018.8615098
Riza LAryani IWihardi YRahman EHerbert Haviluddin (2018)Development of Computational Story for Teaching Algorithm and Programming2018 2nd East Indonesia Conference on Computer and Information Technology (EIConCIT)10.1109/EIConCIT.2018.8878556(326-329)Online publication date: Nov-2018
https://doi.org/10.1109/EIConCIT.2018.8878556
Reynolds LMayo QAdamo DBryce R(2015)Improving conceptual understanding of code with Bug FixerJournal of Computing Sciences in Colleges10.5555/2831432.283144531:2(87-94)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.5555/2831432.2831445
M. JIyer SCajander ÅDaniels MClear TPears A(2014)Problem-solving using the extremality principleProceedings of the 2014 conference on Innovation & technology in computer science education10.1145/2591708.2591718(87-92)Online publication date: 21-Jun-2014
https://dl.acm.org/doi/10.1145/2591708.2591718
Kawash JConnolly RArmitage W(2012)Engaging students by intertwining puzzle-based and problem-based learningProceedings of the 13th annual conference on Information technology education10.1145/2380552.2380617(227-232)Online publication date: 11-Oct-2012
https://dl.acm.org/doi/10.1145/2380552.2380617
Carvalho JDuarte LCarriço LIsbister KMueller FBernhaupt R(2012)Puzzle gamesProceedings of the 4th International Conference on Fun and Games10.1145/2367616.2367624(64-72)Online publication date: 4-Sep-2012
https://dl.acm.org/doi/10.1145/2367616.2367624
Jantan SAljunid S(2012)An experimental evaluation of scaffolded educational games design for programming2012 IEEE Conference on Open Systems10.1109/ICOS.2012.6417631(1-6)Online publication date: Oct-2012
https://doi.org/10.1109/ICOS.2012.6417631
Show More Cited By

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents