Definition of Structured programming

Babylon English
structured programming
programming methodology according to which one builds the main program from modular secondary programs

Search Dictionary:
Search Web Search Dictionary



Structured programming definition was found in categories: Computer & Internet(1)  Science & Technology(1)  Language, Idioms & Slang(1)  Encyclopedia(1)  

Structured programming Definition from Computer & Internet Dictionaries & Glossaries

FOLDOC
structured programming
<programming> Any software development technique that includes structured design and results in the development of a structured program.
(1995-04-06)


Structured programming Definition from Science & Technology Dictionaries & Glossaries

Telecommunication Standard Terms
structured programming
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.


Structured programming Definition from Language, Idioms & Slang Dictionaries & Glossaries

hEnglish - advanced version
structured programming

structured programming
any software development technique that includes structured design and results in the development of a structured program



Structured programming Definition from Encyclopedia Dictionaries & Glossaries

Wikipedia English - The Free Encyclopedia
Structured programming
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:

  1. 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.
  2. 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.
  3. 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...