A Proposal of Element Fill-in-Blank Problems for Self-Study of Web-Client Game Programming

Nowadays, game programming is a dynamic and rapidly evolving domain, driven by its exceptional popularity and continuing growth in technology and entertainment sectors. As gaming industries expand across diverse platforms and audiences, the demand for proficient game developers has been risen significantly. In response, the need for accessible and effective learning resources is leading to a surge of online courses, tutorials, and learning tools. Previously, we have presented the element fill-in-blank problem (EFP) in the programming learning assistant system (PLAS) for self-study of basic web-client programming using HTML, CSS, and JavaScript by novice students. An EFP instance requests to fill in the blanks of the given source code by referring to the screenshots of the corresponding web page. The correctness of any answer is marked through string matching. Tags, function names, or text messages may be blanked in the code. In this paper, we present EFP for self-study of web-client game programming. By solving proposed EFP, it is expected that students not only gain hands-on experience in game programming but also learn in-depth unique programming styles and grammar concepts there. For preliminary evaluations, we generated three EFP instances using source codes for web-client games and assigned them to 20 students in State Polytechnic of Malang, Indonesia. Their solution results confirmed the validity of the proposal.

Institutions

Publication Details

Journal
Engineering headway
Published
2025-10-13
DOI
https://doi.org/10.4028/p-7eiows
Primary Topic
Teaching and Learning Programming
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Proposal of Element Fill-in-Blank Problems for Self-Study of Web-Client Game Programming

Engineering headway
Teaching and Learning Programming
article

A Proposal of Element Fill-in-Blank Problems for Self-Study of Web-Client Game Programming

article en

Abstract

Nowadays, game programming is a dynamic and rapidly evolving domain, driven by its exceptional popularity and continuing growth in technology and entertainment sectors. As gaming industries expand across diverse platforms and audiences, the demand for proficient game developers has been risen significantly. In response, the need for accessible and effective learning resources is leading to a surge of online courses, tutorials, and learning tools. Previously, we have presented the element fill-in-blank problem (EFP) in the programming learning assistant system (PLAS) for self-study of basic web-client programming using HTML, CSS, and JavaScript by novice students. An EFP instance requests to fill in the blanks of the given source code by referring to the screenshots of the corresponding web page. The correctness of any answer is marked through string matching. Tags, function names, or text messages may be blanked in the code. In this paper, we present EFP for self-study of web-client game programming. By solving proposed EFP, it is expected that students not only gain hands-on experience in game programming but also learn in-depth unique programming styles and grammar concepts there. For preliminary evaluations, we generated three EFP instances using source codes for web-client games and assigned them to 20 students in State Polytechnic of Malang, Indonesia. Their solution results confirmed the validity of the proposal.

Engineering headwayVol. 27
Okayama University (JP)
Quality Education
Openalex Percentile: Top 41%
Teaching and Learning Programming
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.