TY - CHAP
T1 - A workbook design for fill-in-blank problems in java programming learning assistant system
AU - Funabiki, Nobuo
AU - Dake, Minako
AU - Zaw, Khin Khin
AU - Kao, Wen Chung
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - 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.
AB - 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.
KW - Conditional Expression
KW - Constraint Graph
KW - Extended Algorithm
KW - Java Code
KW - Maximal Clique
UR - http://www.scopus.com/inward/record.url?scp=85090373540&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85090373540&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-49106-6_31
DO - 10.1007/978-3-319-49106-6_31
M3 - Chapter
AN - SCOPUS:85090373540
T3 - Lecture Notes on Data Engineering and Communications Technologies
SP - 331
EP - 342
BT - Lecture Notes on Data Engineering and Communications Technologies
PB - Springer Science and Business Media Deutschland GmbH
ER -