programming methodology according to which one builds the main program from modular secondary programs
Structured programming can be seen as a subset or subdiscipline of
procedural programming, one of the major
programming paradigms. It is most famous for removing or reducing reliance on the
GOTO statement.Historically, several different structuring techniques or
methodologies have been developed for writing structured programs. The most common are:
Dijkstra's structured programming, where the logic of a program is a structure composed of similar sub-structures in a limited number of ways. This reduces understanding a program to understanding each structure on its own, and in relation to that containing it, a useful
separation of concerns.A view derived from Dijkstra's which also advocates splitting programs into sub-sections with a single point of entry, but is strongly opposed to the concept of a single point of exit.Data Structured Programming, which is based on aligning
data structures with
program structures. This approach applied the fundamental structures proposed by Dijkstra, but as constructs that used the high-level structure of a program to be modeled on the underlying data structures being processed. There are at least 3 major approaches to data structured program design proposed by Jean-Dominique Warnier,
Michael A. Jackson, and Ken Orr.
See more at Wikipedia.org...
A technique for organizing and
coding computer programs in which a hierarchy of modules is used, each having a single entry and a single exit point, and in which control is passed downward through the structure without unconditional branches to higher levels of the structure. Three types of control flow are used: sequential, test, and iteration.
Free Download Now!
