Abstract
To assist Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS provides fill-in-blank problems to let students study Java grammar and basic programming skills by filling the blanked elements in a given Java code. To generate the feasible problems, we have proposed a blank element selection algorithm using the constraint graph to select as many blanks as possible such that they have grammatically correct and unique answers. In this paper, to further increase the number of blanks and control the difficulty of the generated problem, we extend this algorithm by 1) adding operators in conditional expressions for blank candidates, 2) improving the edge generation method in the constraint graph to increase the number of blanks, and 3) introducing two parameters to change the frequency of selecting blanks. To verify the effectiveness, we apply the extended algorithm to 55 Java codes for fundamental data structure or algorithms, and confirm that these extensions can increase the number of blanks and change the problem difficulty.
| Original language | English |
|---|---|
| Title of host publication | 2016 IEEE 5th Global Conference on Consumer Electronics, GCCE 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 9781509023332 |
| DOIs | |
| Publication status | Published - Dec 27 2016 |
| Event | 5th IEEE Global Conference on Consumer Electronics, GCCE 2016 - Kyoto, Japan Duration: Oct 11 2016 → Oct 14 2016 |
Other
| Other | 5th IEEE Global Conference on Consumer Electronics, GCCE 2016 |
|---|---|
| Country | Japan |
| City | Kyoto |
| Period | 10/11/16 → 10/14/16 |
Fingerprint
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering
- Computer Science Applications
- Hardware and Architecture
- Instrumentation