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

article

Using puzzles in teaching algorithms

Authors:

Mary-Angela PapalaskariAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 34, Issue 1

Pages 292 - 296

https://doi.org/10.1145/563517.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

Spurlock SDuvall S(2021)AlgoScrumJournal of Computing Sciences in Colleges10.5555/3447307.344730936:5(24-33)Online publication date: 12-Jan-2021
https://dl.acm.org/doi/10.5555/3447307.3447309
Kalliopi KMichail K(2019)Assessing Computational Thinking Skills at First Stages of SchoolingProceedings of the 2019 3rd International Conference on Education and E-Learning10.1145/3371647.3371651(135-139)Online publication date: 5-Nov-2019
https://dl.acm.org/doi/10.1145/3371647.3371651
Ndjodo MNgah V(2018)From Textual Analysis to Requirements ElicitationComputer Systems and Software Engineering10.4018/978-1-5225-3923-0.ch053(1323-1342)Online publication date: 2018
https://doi.org/10.4018/978-1-5225-3923-0.ch053
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
SIGCSE '02: Proceedings of the 33rd SIGCSE technical symposium on Computer science 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 ...
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 ...
Solving jigsaw puzzles using image features

In this article, we describe a method for automatic solving of the jigsaw puzzle problem based on using image features instead of the shape of the pieces. The image features are used for obtaining an accurate measure for edge similarity to be used in a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCSE Bulletin

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

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

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 2002

Published in SIGCSE Volume 34, Issue 1

Check for updates

Qualifiers

Article

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

Spurlock SDuvall S(2021)AlgoScrumJournal of Computing Sciences in Colleges10.5555/3447307.344730936:5(24-33)Online publication date: 12-Jan-2021
https://dl.acm.org/doi/10.5555/3447307.3447309
Kalliopi KMichail K(2019)Assessing Computational Thinking Skills at First Stages of SchoolingProceedings of the 2019 3rd International Conference on Education and E-Learning10.1145/3371647.3371651(135-139)Online publication date: 5-Nov-2019
https://dl.acm.org/doi/10.1145/3371647.3371651
Ndjodo MNgah V(2018)From Textual Analysis to Requirements ElicitationComputer Systems and Software Engineering10.4018/978-1-5225-3923-0.ch053(1323-1342)Online publication date: 2018
https://doi.org/10.4018/978-1-5225-3923-0.ch053
Choi JLee YLee E(2017)Puzzle Based Algorithm Learning for Cultivating Computational ThinkingWireless Personal Communications: An International Journal10.1007/s11277-016-3679-993:1(131-145)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1007/s11277-016-3679-9
Utsunomiya KAsahiro Y(2015)An Improvement of the Greedy Algorithm for the $$(n^2-1)$$-PuzzleComputational Science and Its Applications -- ICCSA 201510.1007/978-3-319-21407-8_33(457-473)Online publication date: 20-Jun-2015
https://doi.org/10.1007/978-3-319-21407-8_33
Ndjodo MNgah V(2014)From Textual Analysis to Requirements ElicitationOvercoming Challenges in Software Engineering Education10.4018/978-1-4666-5800-4.ch006(92-110)Online publication date: 2014
https://doi.org/10.4018/978-1-4666-5800-4.ch006
Ferreira JMendes ACajander ÅDaniels MClear TPears A(2014)The magic of algorithm design and analysisProceedings of the 2014 conference on Innovation & technology in computer science education10.1145/2591708.2591745(75-80)Online publication date: 21-Jun-2014
https://dl.acm.org/doi/10.1145/2591708.2591745
Gibson JLapidot TGal-Ezer JCaspersen MHazzan O(2012)Teaching graph algorithms to children of all agesProceedings of the 17th ACM annual conference on Innovation and technology in computer science education10.1145/2325296.2325308(34-39)Online publication date: 3-Jul-2012
https://dl.acm.org/doi/10.1145/2325296.2325308
Forišek MSteinová M(2009)Didactic Games for Teaching Information TheoryProceedings of the 4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives: Teaching Fundamentals Concepts of Informatics10.1007/978-3-642-11376-5_9(86-99)Online publication date: 3-Dec-2009
https://dl.acm.org/doi/10.1007/978-3-642-11376-5_9
DePuy GTaylor G(2007)Using Board Puzzles to Teach Operations ResearchINFORMS Transactions on Education10.1287/ited.7.2.1607:2(160-171)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1287/ited.7.2.160
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 Issue’s Table of Contents