Analyze that: Puzzles and analysis of algorithms

Proceedings of the Thirty-Sixth SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2005

Volumn , Issue , 2005, Pages 171-175

  Levitin, Anany ^a  

^a Department of Computing Sciences and Center of Excellence in Enterprise Technology   (United States)

Author keywords

Algorithm analysis; Pedagogy; Puzzles

Indexed keywords

ALGORITHM ANALYSIS; BRAINTEASERS; PEDAGOGY; PUZZLES;

ALGORITHMS; COMPUTER SCIENCE; EDUCATION; HAMILTONIANS; JOB ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING;

GAME THEORY;

EID: 20444455111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Averbach, B. and Chein, O. Mathematics: Problem Solving Through Recreational Mathematics. W.H.Freeman, San Francisco CA, 1980.
2. Bogomolny, A. Mathematical Miscellany and Puzzles. http://www.cut-the-knot.org.
3. Brassard, G. and Bratley, P. Fundamental of Algorithmics. Prentice-Hall, Englewood Cliffs NJ, 1996.
4. Curzon, P. Computing Without Computers, draft of a book, 2001.
5. Demaine, E. Playing games with algorithms: Algorithmic combinatorial game theory, in Proceedings of MFCS '01 (Marianske Lazne, Czech Republic, August 2001), Lecture Notes in Computer Science, vol. 2136, Springer, 18-32.
6. Eppstein, D. Computational Complexity of Games and Puzzles. http://www.ics.uci.edu/~eppstein/cgt/hard.html#sok
7. Gardiner, A. Mathematical Puzzling. Dover, Mineola NY, 1999.
8. Gardner, M., ed. Mathematical Puzzles of Sam Loyd. Dover, New York NY, 1959.
9. Gardner, M. aha! Insight. Scientific American/ W.H.Freeman and Co., New York NY, 1978.
10. Ginat, D. http://www.tau.ac.il/education/homepg/ginat.html
11. Ginat, D. Efficiency of algorithms for programming beginners, in Proceedings of SIGCSE '96 (Philadelphia PA, February 1996), ACM Press, 256-260.
12. Hill, J.M.D. et al. Puzzles and games: addressing different learning styles in teaching operating systems concepts. in Proceedings of SIGCSE '03 (Reno NV, February 2003), ACM Press, 182-186.
13. Huang, T. Strategy game programming projects. JCSC, vol. 16, no. 4, 2001, 205-213.
14. Kaye, R. W. How complicated is minesweeper? http://web.mat.bham.ac.uk/R.W.Kaye/minesw/ASE2003.pdf
15. Knott, R. Fibonacci Numbers and the Golden Section. http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci.
16. Levitin, A. Do we teach the right algorithm design techniques? in Proceedings of SIGCSE '99 (New Orleans LA, March 1999), ACM Press, 179-183.
17. Levitin, A. Introduction to the Design and Analysis of Algorithms. Addison-Wesley, Boston MA, 2002.
18. Levitin, A. and Papalaskari, M-A. Using puzzles in teaching algorithms, in Proceedings of SIGCSE '02 (Northern Kentucky, March 2002), ACM Press, 292-296.
19. Mitchell, W. Another look at CS0. JCSC, vol. 17, no. 1, 2001, 194-205.
20. Mongan, J. and Suojanen, N. Programming Interviews Exposed, Wiley, New York NY, 2000.
21. Parberry, I. Problems on Algorithms. Prentice-Hall, Englewood Cliffs NJ, 1995.
22. Pickover, C.A. The Zen of Magic Squares, Circles, and Stars: An Exhibition of Surprising Structures Across Dimensions. Princeton University Press, Princeton NJ, 2002.
23. Poundstone, W. How Would You Move Mount Fuji? Little, Brown and Company, Boston MA, 2003.
24. Pressman, I., and Singmaster, D. The jealous husbands and the missionaries and cannibals. Math. Gazette, vol. 73, no. 464 (June 1989), 73-81.
25. Rawlins, G.J.E. Compared to What? An Introduction to the Analysis of Algorithms. Computer Science Press, New York NY, 1991.
26. Ross, J. M. Guiding students through programming puzzles: value and examples of Java game assignments. SIGCSE Bulletin, vol. 34, no. 4, 2002, 94-98.
27. Shasha, D. Codes, Puzzles, and Conspiracy. W.H.Freeman, New York NY, 1992.
28. Skiena, S.S., and Revilla, M.A. Programming Challenges: · the Programming Contest Training Manual. Springer, 2003.