Abstract
Chapter 1 introduced the concept of designing programs by the method of stepwise refinement. In essence, we try to decompose a problem into a simple series of subproblems. Given a problem P, we try to discover a set of smaller problems P1, P2, P3, …, such that solving first P1, then P2 and so on will be a solution to the original P. This approach is then applied to each of the subproblems P1, P2, P3, …, producing a set of sub-subproblems whose solutions taken together are a solution to P1. We continue this process until the problems are sufficiently small to be capable of solution directly. It is the continual outside-in analysis of the problem which develops the solution to the problem. This analysis and thus the structure of the solution can be usefully represented and guided by a development tree as shown in figure 5.1.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1978 Derek Coleman
About this chapter
Cite this chapter
Coleman, D. (1978). On Program Design. In: A Structured Programming Approach to Data. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-15981-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-349-15981-9_5
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-21943-0
Online ISBN: 978-1-349-15981-9
eBook Packages: Computer ScienceComputer Science (R0)