Analysis of Fill-in-blank Problem Solutions and Extensions of Blank Element Selection Algorithm for Java Programming Learning Assistant System

A Web-based Java Programming Learning Assistant System (JPLAS) has been developed in our group to advance Java programming educations. JPLAS provides fill-in-blank problems for Java novice students to study grammar and basic programming skills by filling in the blank elements in a highquality code....

Full description

Saved in:
Bibliographic Details
Published in:Lecture notes in engineering and computer science Vol. 1; pp. 237 - 242
Main Authors: Funabiki, Nobuo, Zaw, Khin Khin, Ishihara, Nobuya, Kao, Wen-Chung
Format: Journal Article
Language:English
Published: 21.10.2016
Subjects:
ISBN:9789881404718, 9881404711
ISSN:2078-0958, 2078-0966
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A Web-based Java Programming Learning Assistant System (JPLAS) has been developed in our group to advance Java programming educations. JPLAS provides fill-in-blank problems for Java novice students to study grammar and basic programming skills by filling in the blank elements in a highquality code. In this paper, we first analyze solution results of students in the Java programming course and the correlation between the number of blanks in a problem and the correct answer rate of the students. Then, we extend the blank element selection algorithm to increase the number of blanks and control the problem difficulty by changing it. This algorithm has been proposed to generate a feasible fill-in-blank problem such that any blank has the grammatically correct and unique answer. To verify the effectiveness, we apply the extended algorithm to 5 8 Java codes for the fundamental data structure or algorithms, and confirm that the extensions can increase the number of blanks and control the problem difficulty.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 23
ObjectType-Feature-2
ISBN:9789881404718
9881404711
ISSN:2078-0958
2078-0966