skip to main content
article
Free Access

Loop invariants and mathematical games

Authors Info & Claims
Published:15 March 1995Publication History
Skip Abstract Section

Abstract

The concept of combining loop invariants with algorithm analysis and design is a significant programming tool. However, teaching this concept is not easy. One way of motivating and supporting the introduction of such a concept, is by illustrating it with attractive examples. In this paper we describe how to illustrate it with mathematical games. In our description, we emphasize the links between heuristic search strategies, pattern exploration, induction, and invariant construction.

References

  1. 1 Aho, A., and Ulman J.D., Foundations of Computer Science, Freeman and Co., 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Amow, D., Teaching programming to liberal arts students: Using loop invariants, Proc of the 24th Tech Synp on CS Education, March 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Astrachan, O., Loop invariants in pictures, Proc of the 22nd Tech Symp on CS Education, March 1991.Google ScholarGoogle Scholar
  4. 4 Bright, G.W., Harvey, J.G., and Wheeler, M.M., Game constraints, player verbalizations, and mathematical learning, The Journal of Experimental Education, 49, 1, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5 Chi, M.T.H., and Bassok, M., Learning from examples via self-explanations, Knowing, Learning, and Instruction, Resnick, L.B, editor, Lawrence Erlbaum Associates, 1989.Google ScholarGoogle Scholar
  6. 6 Dijkstra, E.W., A Discipline of Programming, Prentice-Hall, 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Floyd, R., Assigning meaning to programs, Mathematical Aspects of Computer Science, XIX American Mathematical society, 1967.Google ScholarGoogle ScholarCross RefCross Ref
  8. 8 Gries, D., The Science of Programming, Springer-Verlag, 1981. Google ScholarGoogle ScholarCross RefCross Ref
  9. 9 Hoare, C.A.R., An Axiomatic basis for computer programming, CA CM, 12, 5, May 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Manber, U., Using induction to design algorithms, CACM, 31,11, November 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Nesher, P., Microworlds in mathematical education: a pedagogical realism. Knowing, Learning, and Instruction, Resnick, L.B, editor, Lawrence Erlbaum Associates, 1989.Google ScholarGoogle Scholar
  12. 12 Polya, G., How to solve it, Princeton Univ Press, 1957.Google ScholarGoogle Scholar
  13. 13 Schoenfeld, A., Mathematical problem solving, Academic-Press, 1985.Google ScholarGoogle Scholar
  14. 14 Sclaoenfeld, A., Learning to think mathematically" problem solving, metacognition, and sense making in mathematics, Handbook of Ra~areh on Mathematics Teaching and Learning, Macmillan, 1992.Google ScholarGoogle Scholar
  15. 15 Tam, W., Teaching Loop Invariants to Beginners by examples, Proc of the' 23rd Tech Symp on CS Education, March 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 Troeger, D., Experiences teaching loop invariants to beginners, Logic, Loops and Literacy Workshop, May 1993.Google ScholarGoogle Scholar

Index Terms

  1. Loop invariants and mathematical 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 27, Issue 1
                  March 1995
                  402 pages
                  ISSN:0097-8418
                  DOI:10.1145/199691
                  Issue’s Table of Contents
                  • cover image ACM Conferences
                    SIGCSE '95: Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
                    March 1995
                    436 pages
                    ISBN:089791693X
                    DOI:10.1145/199688
                    • Chairman:
                    • Cary Laxer,
                    • Editors:
                    • Curt M. White,
                    • James E. Miller,
                    • Judy Gersting

                  Copyright © 1995 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: 15 March 1995

                  Check for updates

                  Qualifiers

                  • article

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader