METHODS FOR STRUCTURAL TESTING OF PEDAGOGICAL COMPUTER PROGRAMS AND MINIMUM COVERAGE OF THE PROGRAM CONTROL FLOW GRAPH

This article investigates a methodology for the structural testing of pedagogical computer programs using a Control Flow Graph (CFG). The aim of the study is to represent the internal control structure of a program using graph-based and matrix-based models and to identify the minimum set of paths required for test coverage. In the proposed approach, the program source code is first modeled as a Control Flow Graph (CFG), based on which an adjacency matrix is constructed. In the next stage, sequential intermediate nodes that do not constitute independent decision points are reduced to obtain a compact adjacency matrix. The resulting model is then used to calculate the cyclomatic complexity of the program. For the “Vasiyat” program, the cyclomatic complexity was determined as V(G) = 5, based on 25 edges and 22 nodes. In addition, minimum covering paths were identified to cover the main control branches of the program. The results demonstrate that the structural approach makes it possible to systematically test not only the final output of a pedagogical program but also its different execution branches.