DS-theory. The research of P-data factors formating

• Дата: 2018
• Автор: Kolesnyk, V.G.
• Формат: Стаття
• Мова: Російська
• Опубліковано: PROBLEMS IN PROGRAMMING 2018
• Теми: algorithm; algorithmic construction; storage portion; data; node; tree; formatting; UDC 004.424; 004.415
• Онлайн доступ: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/209
• Назва журналу: Problems in programming

This work continues the presentment of the theory of the decomposition schemes as the theory of applied algorithms. The mechanism of conversion of a decomposition scheme into a real applied algorithm conditioned by the variety of data storage forms on the data carriers has been considered. Data storage portion as a phenomenon of electronic data processing has been described and there has also been suggested a general concept of a storage portion. The factors which generate the need for formatting and reformatting the data have been described. Generalized picture of data formatting has been given. The group of algorithmic constructions which realize the procedures of formatting and reformatting of the data for the general case has been suggested. The fact that within the theory of the decomposition schemes there exist considerably more circumstances of combining and cooperation of the storage portions than described in this work has been clarified. The mechanism of the canonic algorithm and synthesis of the algorithmic constructions which realize the procedures of data formatting has been suggested. The process of putting changes into the canonic algorithm is logical and methodic.Problems in programming 2016; 4: 14-26