Paper Info
Title
A proposal of three extensions in blank element selection algorithm for Java programming learning assistant system
Abstract
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.
Year
DOI
Venue
2016
10.1109/GCCE.2016.7800312
2016 IEEE 5th Global Conference on Consumer Electronics
Keywords
Field
DocType
Java programming educations,Web-based Java programming learning assistant system,JPLAS,fill-in-blank problems,Java grammar,basic programming skills,Java code,blank element selection algorithm,constraint graph,conditional expressions,blank candidates,edge generation,fundamental data structure
Scala,Java annotation,Computer science,Java concurrency,Real time Java,Theoretical computer science,Blank,Generics in Java,strictfp,Java
Conference
ISBN
Citations 
PageRank 
978-1-5090-2334-9
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Khin Khin Zaw100.68
Nobuo Funabiki222769.87
Minoru Kuribayashi32319.55