Open AccessIntelligent Test Paper Generation Based on Dynamic Programming Algorithm
Author(s) -
Yifei Wang,
SuRong Wang
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1682/1/012023
Subject(s) - dynamic programming , algorithm , computer science , flexibility (engineering) , greedy algorithm , ramer–douglas–peucker algorithm , function (biology) , dynamic problem , mathematical optimization , mathematics , statistics , evolutionary biology , computation , biology
This paper describes the problem of intelligent paper grouping and its mathematical model. By optimizing and improving the traditional dynamic programming algorithm, its space complexity is reduced from O(nb) to O(b). At the same time, the flexibility of dynamic programming algorithm is increased by using marker function and tracking algorithm, and the result composition is tracked to obtain the optimal solution. Finally, through several experiments, the improved dynamic programming algorithm is compared with the greedy algorithm and brute force algorithm, and it is found that the improved dynamic programming algorithm has a very good result and is with high efficiency when applied to the simple test paper. It is the most recommended algorithm among the two algorithms compared in this paper.