Python 3


PAGE 1/1
Structured programming
Home >>> Free online lessons

Böhm, Jacopini and Dijkstra

Theory of programming languages​​ is extensive, and one of the important concepts is structured programming.

We will learn to program on fundamental structures.

Remarkable is the study published in 1966 by Corrado Böhm and Giuseppe Jacopini ("Structured Programming Theorem"), followed by the work of Dutch scientist Edsger W. Dijkstra which defined the notion of structured programming in 1968. A period of scientific glory, if you think that Neil Armstrong stepped on the moon the following year ...

The principle is as follows:
Any algorithm that has inputs and outputs, ie a start point and an end point, can be represented through a combination of four fundamental control structures called:
sequence (ordered statements or subroutines executed in sequence)
selection (one or a number of statements is executed depending on the state of the program)
iteration (a statement or block is executed until the program reaches a certain state)
recursion (a statement is executed by repeatedly calling itself until termination conditions are met)
Structured programming allows programs to be written in natural language as well (called pseudocode), independent of the practical one.

Programs are based on computational algorithms, which can be translated into logic schemes, such as the following:

We will also use logic schemes in this course. They're super cool, synthesizing the algorithm and you better understand how the program works!
Remember this important information.
 home   list  LESSONS   arrow_upward