### 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.

Original language | English |
---|---|

Title of host publication | IMECS 2015 - International MultiConference of Engineers and Computer Scientists 2015 |

Publisher | Newswood Limited |

Pages | 448-453 |

Number of pages | 6 |

Volume | 1 |

ISBN (Print) | 9789881925329 |

Publication status | Published - 2015 |

Event | International MultiConference of Engineers and Computer Scientists 2015, IMECS 2015 - Tsimshatsui, Kowloon, Hong Kong Duration: Mar 18 2015 → Mar 20 2015 |

### Other

Other | International MultiConference of Engineers and Computer Scientists 2015, IMECS 2015 |
---|---|

Country | Hong Kong |

City | Tsimshatsui, Kowloon |

Period | 3/18/15 → 3/20/15 |

### Fingerprint

### Keywords

- Algorithm
- Blank element selection
- Clique
- Fill-in-blank problem
- Graph
- Java programming education
- JPLAS

### ASJC Scopus subject areas

- Computer Science (miscellaneous)

### Cite this

*IMECS 2015 - International MultiConference of Engineers and Computer Scientists 2015*(Vol. 1, pp. 448-453). Newswood Limited.

**A proposal of graph-based blank element selection algorithm for Java programming learning with fill-in-blank problems.** / Tana, T.; Funabiki, Nobuo.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IMECS 2015 - International MultiConference of Engineers and Computer Scientists 2015.*vol. 1, Newswood Limited, pp. 448-453, International MultiConference of Engineers and Computer Scientists 2015, IMECS 2015, Tsimshatsui, Kowloon, Hong Kong, 3/18/15.

}

TY - GEN

T1 - A proposal of graph-based blank element selection algorithm for Java programming learning with fill-in-blank problems

AU - Tana, T.

AU - Funabiki, Nobuo

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Algorithm

KW - Blank element selection

KW - Clique

KW - Fill-in-blank problem

KW - Graph

KW - Java programming education

KW - JPLAS

UR - http://www.scopus.com/inward/record.url?scp=84938118255&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938118255&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84938118255

SN - 9789881925329

VL - 1

SP - 448

EP - 453

BT - IMECS 2015 - International MultiConference of Engineers and Computer Scientists 2015

PB - Newswood Limited

ER -