When evaluating student work, the analysis of written assignments, particularly the analysis of source code, becomes particularly relevant. This article discusses an approach for evaluating the dynamics of feature changes in students' source code. Various metrics of source code are analyzed and key metrics are identified, including quantitative metrics, program control flow complexity metrics, and the TIOBE quality indicator. A set of text data containing program source codes from a website dedicated to practical programming, was used to determine threshold values for each metric and categorize them. The obtained results were used to conduct an analysis of students' source code using a developed service that allows for the evaluation of work based on key features, the observation of dynamics in code indicators, and the understanding of a student's position within the group based on the obtained values.

Keywords: machine learning, text data analysis, program code analysis, digital footprint, data visualization

the article describes a variant of setting sequential algorithms in the form of bipartite graphs by further defining them, which makes it possible to work with algorithms using graph theory methods in the future. Two forms of the task are considered: modular and functional-predicative. The possibility of setting the algorithm in table-predicate form is shown. It is concluded that in addition to the generally accepted methods of setting the algorithm, it can be set in matrix-predicate or table-predicate form, which allows using methods of matrix theory and methods of predicate theory when working with algorithms. setting the algorithm in matrix-predicate form avoids isomorphism when performing algebraic and set-theoretic operations on it.; setting algorithms in matrix-predicate form allows you to perform almost any operations on them

Keywords: graph-algorithm scheme, sequential algorithm, predicative block, functional block, pre-definition, bipartite graph, table-predicative form, graph theory, isomorphism

The article describes the algorithm of recognition of schematic diagrams in the framework of structural design of complex technical objects. It is specified that at statement of a problem of development of the specialized vectorizer it is necessary to define: software subsystems of the simplest tracer; algorithms of the analysis of images; formats of representation of the end result; initial data (formats) for recognition. As a result, it was concluded that for structural and circuit design, during which the vertex of the final portrait of the graph of the projected system is replaced, obtained after optimization by the criterion of the set of the smallest external stability, it is necessary to recognize images of graphic elements. The proposed algorithm allows for adequate recognition of the elements of electronic circuits, which further makes it possible to automatically replenish the database of elements with new elements in a given format.

Keywords: vectorization, concept recognition algorithm, structural design, graphic, element, raster image, electronic circuits, semi-graphical display, block-the functional distribution of the tracer

`

Keywords: