Abstract
In the student programming examination, the program must be automatically evaluated. It can be not give a reasonable score to the wrong program by comparing the output results of the dynamic evaluation method. Only by using the static analysis of the program can it give more accurate results. In this paper, the ratio of the length of the program feature vector and the Token sequence are introduced in two static analysis algorithms of attribute count and the longest common subsequence, and the optimum weight of various algorithms is determined by experiments. The experimental results show that the score given by the algorithm is very close to the teacher's score, which proves that the algorithm is an effective automatic scoring method.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
