TY - GEN
T1 - A proposal of three extensions in blank element selection algorithm for Java programming learning assistant system
AU - Zaw, Khin Khin
AU - Funabiki, Nobuo
AU - Kuribayashi, Minoru
N1 - Publisher Copyright:
© 2016 IEEE.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2016/12/27
Y1 - 2016/12/27
N2 - To assist Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS provides fill-in-blank problems to let students study Java grammar and basic programming skills by filling the blanked elements in a given Java code. To generate the feasible problems, we have proposed a blank element selection algorithm using the constraint graph to select as many blanks as possible such that they have grammatically correct and unique answers. In this paper, to further increase the number of blanks and control the difficulty of the generated problem, we extend this algorithm by 1) adding operators in conditional expressions for blank candidates, 2) improving the edge generation method in the constraint graph to increase the number of blanks, and 3) introducing two parameters to change the frequency of selecting blanks. To verify the effectiveness, we apply the extended algorithm to 55 Java codes for fundamental data structure or algorithms, and confirm that these extensions can increase the number of blanks and change the problem difficulty.
AB - To assist Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS provides fill-in-blank problems to let students study Java grammar and basic programming skills by filling the blanked elements in a given Java code. To generate the feasible problems, we have proposed a blank element selection algorithm using the constraint graph to select as many blanks as possible such that they have grammatically correct and unique answers. In this paper, to further increase the number of blanks and control the difficulty of the generated problem, we extend this algorithm by 1) adding operators in conditional expressions for blank candidates, 2) improving the edge generation method in the constraint graph to increase the number of blanks, and 3) introducing two parameters to change the frequency of selecting blanks. To verify the effectiveness, we apply the extended algorithm to 55 Java codes for fundamental data structure or algorithms, and confirm that these extensions can increase the number of blanks and change the problem difficulty.
UR - http://www.scopus.com/inward/record.url?scp=85010310991&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85010310991&partnerID=8YFLogxK
U2 - 10.1109/GCCE.2016.7800312
DO - 10.1109/GCCE.2016.7800312
M3 - Conference contribution
AN - SCOPUS:85010310991
T3 - 2016 IEEE 5th Global Conference on Consumer Electronics, GCCE 2016
BT - 2016 IEEE 5th Global Conference on Consumer Electronics, GCCE 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th IEEE Global Conference on Consumer Electronics, GCCE 2016
Y2 - 11 October 2016 through 14 October 2016
ER -