Introducing Top-down Design

  • Suad Alagić
  • Michael A. Arbib
Part of the Texts and Monographs in Computer Science book series (MCS)


If we want a computer to solve a problem for us, we must develop an algorithm—a recipe which spells out explicitly and unambiguously the steps which must be carried out on the problem data to obtain a correct solution (where one exists) within a finite time. We must specify this algorithm so precisely that its instructions can be followed automatically by a computer. In other words, the algorithm must be written as a program in a programming language—a specially chosen notation in which we specify algorithms to a level of detail suitable for mechanical interpretation. We shall say more about programming languages in Section 1.3, and we shall devote many pages to showing the reader how to program in Pascal, a programming language which is particularly well suited for the specification of algorithms. However, the thrust of our book is that, although the final product of the programmer’s task is expressed in a programming language, the specific properties of the language should not enter into the early stages of algorithm development.


Programming Language Nonnegative Integer Repetition Process Sequential Composition Great Common Divisor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag, New York Inc. 1978

Authors and Affiliations

  • Suad Alagić
    • 1
  • Michael A. Arbib
    • 2
  1. 1.Department of Informatics, Faculty of Electrical EngineeringUniversity of SarajevoSarajevoYugoslavia
  2. 2.Department of Computer and Information ScienceUniversity of MassachusettsAmherstUSA

Personalised recommendations