skip to main content
article
Free Access

A data-oriented introduction to program design

Published:01 December 1979Publication History
Skip Abstract Section

Abstract

Stepwise refinement is an invaluable analytic tool for solving complex problems, but it is somewhat artificial for the simple problems encountered in the first half of an introductory programming course. This paper describes an alternate process which still provides for a gradual transition from a problem to an algorithm which solves the problem. Each algorithm, which is unambiguous and English-like, is synthesized from sample data and can be routinely translated into a (structured) program.

References

  1. Hume, J. N. and Holt, R. C., "Structured Programming Using PL/1 and SP/k," Reston Publishing Company, Reston, VA, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Jackson, M. A., "Principles of Program Design, " Academic Press, New York, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Wirth, N., "Algorithms + Data Structures = Programs," Prentice-Hall, Englewood Cliffs, New Jersey, 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library

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 11, Issue 4
    December 1979
    54 pages
    ISSN:0097-8418
    DOI:10.1145/988938
    Issue’s Table of Contents

    Copyright © 1979 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 December 1979

    Check for updates

    Qualifiers

    • article
  • Article Metrics

    • Downloads (Last 12 months)14
    • Downloads (Last 6 weeks)2

    Other Metrics

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!