Structured Programming
978-613-0-32097-3
6130320973
72
2013-09-23
29.00 €
eng
https://images.our-assets.com/cover/230x230/9786130320973.jpg
https://images.our-assets.com/fullcover/230x230/9786130320973.jpg
https://images.our-assets.com/cover/2000x/9786130320973.jpg
https://images.our-assets.com/fullcover/2000x/9786130320973.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Structured programming can be seen as a subset or subdiscipline of imperative programming, one of the major programming paradigms. It is most famous for removing or reducing reliance on the GOTO statement. The structured program theorem provides the theoretical basis of structured programming. It states that three ways of combining programs—sequencing, selection, and iteration—are sufficient to express any computable function. This observation did not originate with the structured programming movement; these structures are sufficient to describe the instruction cycle of a central processing unit, as well as the operation of a Turing machine. Therefore a processor is always executing a "structured program" in this sense, even if the instructions it reads from memory are not part of a structured program.
https://www.morebooks.de/books/ru/published_by/betascript-publishing/1/products
Информатика, ИТ
https://www.morebooks.de/store/ru/book/structured-programming/isbn/978-613-0-32097-3