skip to main content
article
Free Access

From specific problem instances to algorithms in the introductory course

Published:12 March 1994Publication History
Skip Abstract Section

Abstract

In this paper, we present an approach for the introduction of problem solving and algorithm development in the first computer science course. Our technique is a more formal and systematic approach to programming based on generalizing a pattern after studying and expanding on a sequence of specific problem instances. In our approach, the algorithm and justification of its correctness are developed together.

References

  1. 1 O. Astrachan. Pictures as invariants, in Proceedings of the 1991 SIGCSE Technical Symposium on Compute.r Science Education, pages 112-118, March 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 W.J. Collins. The trouble with for-loop invariants. In Proceedings of the 1988 SIGCSE Technical Symposium on Computer Science Education, pages 1-4, February 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 E.W. Dijkstra and W.H.3. Feijen. A Method of Programming. Addison Wesley, Reading, MA, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 D. Gries. The Science of Programming. Springer- Verlag, New York, 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 D. Gries. Teaching calculation and discrimination: A more effective curriculum. Communications of the A CM, 34(3):44-55, March 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 P.B. Henderson. Discrete mathematics as precursor to programming. In Proceedings of the 1990 SIGCSE Technical Symposium on Computer Science Education, pages 17-21, February 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 B.L. Kurtz and J.M. Adams. Using concept expansion and level integration in an introductory computer science course. In Proceedings o} the 1988 SIGCSE Technical Symposium on Computer Science Education, pages 244-248, February 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 U. Manber. Using induction to design algorithms. Communicatzons of the ACM, 31(11):1300-1313, November 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 U. Manber. Introduction to Algorithms: A Creative Approach. Addison Wesley, Reading, MA, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 P. Montague. A correctness proof for binary search. Computer Science Education, 2(1):81-89, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  11. 11 W.C. Tam. Teaching loop invariants to beginners by example. In Proceedings of the 1992 SIGCSE Technical Symposium on Computer Science Education, pages 92-- 96, March 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 A.B. Tucker, W.J. Bradley, R.D. Cupper, and D.K. Garnick. Fundamentals of Computing I: Logic, Prob. lem Solving, Programs, and Computers. McGraw-Hill:, New York, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. From specific problem instances to algorithms in the introductory course

        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 26, Issue 1
          March 1994
          410 pages
          ISSN:0097-8418
          DOI:10.1145/191033
          Issue’s Table of Contents
          • cover image ACM Conferences
            SIGCSE '94: Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
            March 1994
            414 pages
            ISBN:0897916468
            DOI:10.1145/191029

          Copyright © 1994 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 12 March 1994

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!