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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

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 languageEnglish
Title of host publicationIMECS 2015 - International MultiConference of Engineers and Computer Scientists 2015
EditorsJeong-A Lee, S. I. Ao, Craig Douglas, Craig Douglas, David Dagan Feng, S. I. Ao, S. I. Ao, Oscar Castillo
PublisherNewswood Limited
Pages448-453
Number of pages6
ISBN (Electronic)9789881925329
Publication statusPublished - Jan 1 2015
EventInternational MultiConference of Engineers and Computer Scientists 2015, IMECS 2015 - Tsimshatsui, Kowloon, Hong Kong
Duration: Mar 18 2015Mar 20 2015

Publication series

NameLecture Notes in Engineering and Computer Science
Volume1
ISSN (Print)2078-0958

Other

OtherInternational MultiConference of Engineers and Computer Scientists 2015, IMECS 2015
CountryHong Kong
CityTsimshatsui, Kowloon
Period3/18/153/20/15

Keywords

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

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Fingerprint Dive into the research topics of 'A proposal of graph-based blank element selection algorithm for Java programming learning with fill-in-blank problems'. Together they form a unique fingerprint.

  • Cite this

    Tana, T., & Funabiki, N. (2015). A proposal of graph-based blank element selection algorithm for Java programming learning with fill-in-blank problems. In J-A. Lee, S. I. Ao, C. Douglas, C. Douglas, D. D. Feng, S. I. Ao, S. I. Ao, & O. Castillo (Eds.), IMECS 2015 - International MultiConference of Engineers and Computer Scientists 2015 (pp. 448-453). (Lecture Notes in Engineering and Computer Science; Vol. 1). Newswood Limited.