A Workbook Design for Fill-in-Blank Problems in Java Programming Learning Assistant System

  • Nobuo FunabikiEmail author
  • Minako Dake
  • Khin Khin Zaw
  • Wen-Chung Kao
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 2)


To advance Java programming educations, we have developed a Java Programming Learning Assistant System (JPLAS) as a Web application system. JPLAS provides fill-in-blank problems for novice students to study the grammar and basic programming skills through code reading. To select the blank elements with grammatically correct and unique answers from a given code, we have proposed the graph-based blank element selection algorithm. Then, we generated and assigned fill-in-blank problems to students in Java programming course for two years. Unfortunately, the teacher selected original Java codes rather arbitrarily, which may degrade educational effects. Besides, this algorithm has been continuously extended to enhance the variations of generated problems. In this paper, we present a workbook design for fill-in-blank problems in JPLAS by collecting suitable Java codes from textbooks and Web sites, and applying the extended algorithm, so that they can be instantly and properly assigned to students. This workbook design consists of 15 categories with a considerable number of problems that follow the conventional learning order of Java programming. For the preliminary evaluation, we assign some problems to novice students. In the coming semester, we will use this workbook in the course to verify the adequacy of our proposal for novice students.


Maximal Clique Java Code Constraint Graph Conditional Expression Extended Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Funabiki, N., Matsushima, Y., Nakanishi, T., Amano, N.: A Java programming learning assistant system using test-driven development method. Int. J. Comput. Sci. 40(1), 38-46 (2013)Google Scholar
  2. 2.
    Tana, Funabiki, N., Ishihara, N.: A proposal of graph-based blank element selection algorithm for Java programming learning with fill-in-blank problem. In: IMECS2015, pp. 448-453 (2015)Google Scholar
  3. 3.
    Zaw, K. K., Funabiki, N., Kuribayashi, M.: A proposal of three extensions in blank element selection algorithm for Java programming learning assistant system. to appear In: GCCE2016 (2016)Google Scholar
  4. 4.
    Garey, M. R., Johnson, D. S.: Computers and intractability: A guide to the theory of NPcompleteness. Freeman, New York (1979)Google Scholar
  5. 5.
    Tana, Funabiki, N., Ishihara, N., Kao, W.-C.: Correlation analysis of fill-in-blank problem solutions to final programming results in Java programming course. In: GCCE2015, pp. 348-349 (2015)Google Scholar
  6. 6.
    Funabiki, N., Tana, Ishihara, N., Kao, W.-C.: Analysis of fill-in-blank problem solution results in Java programming course. to appear In: GCCE2016 (2016)Google Scholar
  7. 7.
    Piech, C., Sahami, M., Koller, D., Cooper, S., Blikstein, P.: Modeling how students learn to program. In: SIGCSE ’12, pp. 153-160 (2012)Google Scholar
  8. 8.
    Hosseini R., Brusilovsky, P.: JavaParser: a fine-grained concept indexing tool for Java problems. In: AIED 2013 (2013)Google Scholar
  9. 9.
    Delev T., Gjorgjevikj, D.: A study on implementation and usage of web based programming assessment system: Code. In: ICT Innovations 2014, pp. 76-85 (2014)Google Scholar
  10. 10.
    Brown, N. C. C., Altadmri, A.: Investigating novice programming mistakes: educator beliefs vs student data. In: ICER ’14 (2014)Google Scholar
  11. 11.
    Altadmri, A. Brown, N. C. C.: 37 million compilations: investigating novice programming mistakes in large-scale student data. In: SIGCSE ’15 (2015)Google Scholar
  12. 12.
    Busjahn, T., Bednariky, R. Schulte, C.: What influences dwell time during source code reading? Analysis of element type and frequency as factors. In: ETRA 2014, pp. 335-338 (2014)Google Scholar
  13. 13.
  14. 14.
  15. 15.
    Yuki, H.: Java programming lesson. Softbank Creative, Tokyo (2012),
  16. 16.
    Takahashi, M.: Easy Java. Softbank Creative, Tokyo (2013),˜mana/yasaj.html
  17. 17.
    Kondo, Y.: Algorithm and data structure for Java programmers. Softbank Creative, Tokyo (2011)Google Scholar
  18. 18.
  19. 19.
  20. 20.
  21. 21.
  22. 22.
  23. 23.
    Chang, S. K.: Data structures and algorithms. World Scientific Pub., New Jersey (2003)Google Scholar
  24. 24.
  25. 25.
  26. 26.
  27. 27.
  28. 28.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Nobuo Funabiki
    • 1
    Email author
  • Minako Dake
    • 1
  • Khin Khin Zaw
    • 1
  • Wen-Chung Kao
    • 2
  1. 1.Okayama UniversityOkayamaJapan
  2. 2.National Taiwan Normal UniversityTaipeiTaiwan

Personalised recommendations