@inproceedings{849fec2b11834b6b9d30ec69cfc5469c,

title = "A proposal of graph-based blank element selection algorithm for Java programming learning with fill-in-blank problems",

abstract = "To assist Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS provides fill-in-blank problems for novice students to learn Java by filling blank elements composed of reserved words, identifiers, and control symbols. In this paper, we propose a graph-based blank element selection algorithm to select as many blanks as possible such that any blank has the grammatically correct unique answer. Our algorithm first generates a graph by selecting every candidate element in the code as a vertex, and connecting any pair of vertices by an edge if they can be blanked together, where the conditions for simultaneous blanks are defined. Then, it extracts a maximal set of blank elements by seeking a maximal clique of the graph. We verify the algorithm through applications to 100 Java codes, where the answer uniqueness is manually confirmed and the number of blank elements is almost proportional to the number of statements in a code.",

keywords = "Algorithm, Blank element selection, Clique, Fill-in-blank problem, Graph, JPLAS, Java programming education",

author = "T. Tana and Nobuo Funabiki",

year = "2015",

month = jan,

day = "1",

language = "English",

series = "Lecture Notes in Engineering and Computer Science",

publisher = "Newswood Limited",

pages = "448--453",

editor = "Jeong-A Lee and Ao, {S. I.} and Craig Douglas and Craig Douglas and Feng, {David Dagan} and Ao, {S. I.} and Ao, {S. I.} and Oscar Castillo",

booktitle = "IMECS 2015 - International MultiConference of Engineers and Computer Scientists 2015",

note = "International MultiConference of Engineers and Computer Scientists 2015, IMECS 2015 ; Conference date: 18-03-2015 Through 20-03-2015",

}