Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Advances on Broad-Band Wireless Computing, Communication and Applications (BWCCA 2016)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 2))

  • 1378 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. Garey, M. R., Johnson, D. S.: Computers and intractability: A guide to the theory of NPcompleteness. Freeman, New York (1979)

    Google Scholar 

  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. 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. 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. Hosseini R., Brusilovsky, P.: JavaParser: a fine-grained concept indexing tool for Java problems. In: AIED 2013 (2013)

    Google Scholar 

  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. Brown, N. C. C., Altadmri, A.: Investigating novice programming mistakes: educator beliefs vs student data. In: ICER ’14 (2014)

    Google Scholar 

  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. 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. JFlex. http://jflex.de/

  14. jay. http://www.cs.rit.edu/~ats/projects/lp/doc/jay/package-summary.html

  15. Yuki, H.: Java programming lesson. Softbank Creative, Tokyo (2012), http://www.hyuki.com/jb/#download

  16. Takahashi, M.: Easy Java. Softbank Creative, Tokyo (2013), http://homepage3.nifty.com/Ëœmana/yasaj.html

  17. Kondo, Y.: Algorithm and data structure for Java programmers. Softbank Creative, Tokyo (2011)

    Google Scholar 

  18. ITSenka. http://www.itsenka.com/

  19. tutorialspoint, http://www.tutorialspoint.com/java/index.htm

  20. Java program samples. http://www7a.biglobe.ne.jp/~java-master/samples/

  21. Shellsort. http://www.thelearningpoint.net/computer-science/arrays-and-sorting-shell-sort-with-c-program-source-code

  22. Sinapova, L.: Lecture Notes, http://faculty.simpson.edu/lydia.sinapova/www/cmsc250/LN250_Weiss/Contents.htm

  23. Chang, S. K.: Data structures and algorithms. World Scientific Pub., New Jersey (2003)

    Google Scholar 

  24. Dijkstra Algorithm. http://www.ifp.illinois.edu/~angelia/ge330fall09_dijkstra_l18.pdf

  25. Prim Java. http://cs.fit.edu/~ryan/java/programs/graph/Prim-java.html

  26. Graph Java. http://www.sanfoundry.com/java-program

  27. Depth First Search. https://en.wikipedia.org/wiki/Breadth-first_search

  28. Breadth First Search. https://en.wikipedia.org/wiki/Depth-first_search

Download references

Author information

Authors and Affiliations

  1. Okayama University, Okayama, Japan

    Nobuo Funabiki, Minako Dake & Khin Khin Zaw

  2. National Taiwan Normal University, Taipei, Taiwan

    Wen-Chung Kao

Authors
  1. Nobuo Funabiki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minako Dake
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Khin Khin Zaw
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wen-Chung Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nobuo Funabiki .

Editor information

Editors and Affiliations

  1. Fukuoka Institute of Technology , Fukuoka, Japan

    Leonard Barolli

  2. Campus Nord,Ed. Omega (Room 109), Technical University of Catalonia Campus Nord,Ed. Omega (Room 109), Barcelona, Spain

    Fatos Xhafa

  3. Department of Information Security Engin, Soonchunhyang University Department of Information Security Engin, Asan-si, Korea (Republic of)

    Kangbin Yim

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Funabiki, N., Dake, M., Zaw, K.K., Kao, WC. (2017). A Workbook Design for Fill-in-Blank Problems in Java Programming Learning Assistant System. In: Barolli, L., Xhafa, F., Yim, K. (eds) Advances on Broad-Band Wireless Computing, Communication and Applications. BWCCA 2016. Lecture Notes on Data Engineering and Communications Technologies, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-319-49106-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49106-6_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49105-9

  • Online ISBN: 978-3-319-49106-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation