| Related Publication |
@Article{data8060109,
AUTHOR = {Demidova, Liliya A. and Andrianova, Elena G. and Sovietov, Peter N. and Gorchakov, Artyom V.},
TITLE = {Dataset of Program Source Codes Solving Unique Programming Exercises Generated by Digital Teaching Assistant},
JOURNAL = {Data},
VOLUME = {8},
YEAR = {2023},
NUMBER = {6},
ARTICLE-NUMBER = {109},
URL = {https://www.mdpi.com/2306-5729/8/6/109},
ISSN = {2306-5729},
ABSTRACT = {This paper presents a dataset containing automatically collected source codes solving unique programming exercises of different types. The programming exercises were automatically generated by the Digital Teaching Assistant (DTA) system that automates a massive Python programming course at MIREA—Russian Technological University (RTU MIREA). Source codes of the small programs grouped by the type of the solved task can be used for benchmarking source code classification and clustering algorithms. Moreover, the data can be used for training intelligent program synthesizers or benchmarking mutation testing frameworks, and more applications are yet to be discovered. We describe the architecture of the DTA system, aiming to provide detailed insight regarding how and why the dataset was collected. In addition, we describe the algorithms responsible for source code analysis in the DTA system. These algorithms use vector representations of programs based on Markov chains, compute pairwise Jensen–Shannon divergences of programs, and apply hierarchical clustering algorithms in order to automatically discover high-level concepts used by students while solving unique tasks. The proposed approach can be incorporated into massive programming courses when there is a need to identify approaches implemented by students.},
DOI = {10.3390/data8060109}
} |