The use of dynamic data processing structures on the example of list transformation tasks

Dmitry Zdor

Abstract


Information processing is a key operation with information. In this regard, the study mainstreams the issue of choosing the structural organisation of data for the purposes of organising the processing operation. Dynamic data structures are used in cases where there is no clarity regarding the required size of the structure used when solving a problem. Another area of applying the dynamic structures is the task of processing large amounts of data, including the task of converting large amounts of data. In such a situation, the use of lists becomes practical. These circumstances actualise the problem of finding effective methods for processing lists. Tasks for transforming lists deserve special attention in this aspect. Features of the use of dynamic data processing structures based on recursive methods is one of the urgent issues in the context of the use of systems with elements of artificial intelligence. The purpose of the study is to analyse the use of recursive methods in tasks for transforming lists. Recursive methods are effectively used in list processing tasks. The use of recursion is possible not only in standard tasks for processing elements of one list, but also in tasks for transforming multiple lists, for example, in the tasks of combining two lists into one, dividing one list into two. Using these tasks as an example, the authors of the study perform a detailed analysis of the use of recursive methods at the level of predicate comparison and concretisation of variables in a Prolog programme. Using the example of the tasks of combining two lists into one, dividing one list into two, the study thoroughly describes the method of using recursive rules for processing lists. The description of the solution of problems, the analysis of the execution of recursion in the considered examples can serve as a technological basis for solving other problems for the transformation of lists. The results obtained can be used in the further investigation of issues of applying recursive methods in problems of processing lists, as well as in the educational process upon studying the theoretical foundations of computer science and logical programming.


Full Text:

PDF (Russian)

References


Pavlov, L.A. 2020. Structures and algorithms for data processing. St. Petersburg: Lan.

Metakides, G. 1998. Principles of logic and logical programming. Moscow: Factorial.

Sterling, L. 1990. The art of programming in the prologue language. Moscow: Mir.

Tsukanova, N.I. 2013. Theory and practice of logical programming in the Visual Prolog 7 language. Moscow: Hotline-Telecom.

Kloksin, W. 1987. Programming in the Prolog language. Moscow: Mir.

Khusainov, B.S. 2004. Structures and algorithms for data processing. Examples in C language. Moscow: Finance and statistics.

Adamenko, A. N. 2003. Logical programming and Visual Prolog. St. Petersburg: BHV-Petersburg.

Bratko, I. 2004. Algorithms of artificial intelligence in the Prolog language. Moscow: Williams.

Agafonova, V.N. 1988. Logic programming. Moscow: Mir.

Markov, V.N. 2016. Modern logic programming in the Visual Prolog 7/5 language. St. Petersburg: BHV-Petersburg.

Tarushkin, V.T., Tarushkin, P.V., Tarushkina, L.T., Yurkov, A.V. 2010. Predicate Logic and the Prologue Language. Modern Science-Intensive Technologies, 4, 62-63.

Costa E. 2010. Visual Prolog 7.3 for Tyros. http://visual-prolog.com/download/73/books/tyros/tyros73.pdf

Virt, N. 2010. Algorithms and data structures. Moscow: DMK Press.

Aho, A. 2016. Data structures and algorithms. Moscow: Williams.

Cormen, T., Leiserson, C., Rivest, R., Stein, K. 2014. Algorithms: construction and analysis. Moscow: Williams.


Refbacks

  • There are currently no refbacks.


Abava  Absolutech Convergent 2020

ISSN: 2307-8162