{"title":"关于产生大量可比较测试变量的问题","authors":"M. Gangur, Miroslav Plevný","doi":"10.7160/ERIESJ.2018.110402","DOIUrl":null,"url":null,"abstract":"The paper presents a possible way of solving the problem of creating more test variants for a large number of students divided into groups. The proposed solution may consist in introducing a parameterized automatic test generator. The principle of an automatic parameterized test generator is shown. The process of the question tree construction according to the increasing numbers of questions in the banks of the particular subjects leads to a combinatorial explosion. This often results in the excessive time of generation of the different variants of tests. To solve this problem, a heuristic method based on a pre-processing stage that precedes the construction of the searching tree is proposed. Further, the results of the experiments comparing the time of the test generation and the congruence of the test variants generated by the algorithm either using or non-using this heuristics are presented. According to these results, the use of the generator with the proposed heuristics provides a considerably shorter time of generation, and the congruence of the generated test variants is even better in most cases.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Problem of Generating a Large Number of Comparable Test Variants\",\"authors\":\"M. Gangur, Miroslav Plevný\",\"doi\":\"10.7160/ERIESJ.2018.110402\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a possible way of solving the problem of creating more test variants for a large number of students divided into groups. The proposed solution may consist in introducing a parameterized automatic test generator. The principle of an automatic parameterized test generator is shown. The process of the question tree construction according to the increasing numbers of questions in the banks of the particular subjects leads to a combinatorial explosion. This often results in the excessive time of generation of the different variants of tests. To solve this problem, a heuristic method based on a pre-processing stage that precedes the construction of the searching tree is proposed. Further, the results of the experiments comparing the time of the test generation and the congruence of the test variants generated by the algorithm either using or non-using this heuristics are presented. According to these results, the use of the generator with the proposed heuristics provides a considerably shorter time of generation, and the congruence of the generated test variants is even better in most cases.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2018-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7160/ERIESJ.2018.110402\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7160/ERIESJ.2018.110402","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Problem of Generating a Large Number of Comparable Test Variants
The paper presents a possible way of solving the problem of creating more test variants for a large number of students divided into groups. The proposed solution may consist in introducing a parameterized automatic test generator. The principle of an automatic parameterized test generator is shown. The process of the question tree construction according to the increasing numbers of questions in the banks of the particular subjects leads to a combinatorial explosion. This often results in the excessive time of generation of the different variants of tests. To solve this problem, a heuristic method based on a pre-processing stage that precedes the construction of the searching tree is proposed. Further, the results of the experiments comparing the time of the test generation and the congruence of the test variants generated by the algorithm either using or non-using this heuristics are presented. According to these results, the use of the generator with the proposed heuristics provides a considerably shorter time of generation, and the congruence of the generated test variants is even better in most cases.