TY - GEN
T1 - Improvements of Blank Element Selection Algorithm for Element Fill-in-blank Problem in Web-client Programming
AU - Qi, Huiyu
AU - Funabiki, Nobuo
AU - Wai, Khaing Hsu
AU - Veronicha Hendryanna, Flasma
AU - Kao, Wen Chung
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - In modern societies, web application systems take main roles among Internet-based information systems. To enhance educations of web-client programming for interactive user interfaces on browsers, we have studied the Element Fill-in-blank Problem (EFP) as a self-guided learning tool. EFP involves students completing the given source code based on the web page screenshots, fostering a dynamic approach to mastering web-client programming. Previously, the blank element selection algorithm has been studied to automatically generate EFP instances from source codes. However, the current algorithm encounters several limitations such as selections of meaningless blanks and insufficient selections of CSS properties. In this paper, we propose two improvements of this algorithm to address the limitations, namely, the two-step blank element identification and the key CSS property consideration. These improvements will help generate higher-quality EFP instances. As the evaluation of the proposal, we compared the outputs of the previous and proposed algorithms on the 10 source codes, and confirmed that the proposal could avoid meaningless blanks and increase the blanks for CSS properties.
AB - In modern societies, web application systems take main roles among Internet-based information systems. To enhance educations of web-client programming for interactive user interfaces on browsers, we have studied the Element Fill-in-blank Problem (EFP) as a self-guided learning tool. EFP involves students completing the given source code based on the web page screenshots, fostering a dynamic approach to mastering web-client programming. Previously, the blank element selection algorithm has been studied to automatically generate EFP instances from source codes. However, the current algorithm encounters several limitations such as selections of meaningless blanks and insufficient selections of CSS properties. In this paper, we propose two improvements of this algorithm to address the limitations, namely, the two-step blank element identification and the key CSS property consideration. These improvements will help generate higher-quality EFP instances. As the evaluation of the proposal, we compared the outputs of the previous and proposed algorithms on the 10 source codes, and confirmed that the proposal could avoid meaningless blanks and increase the blanks for CSS properties.
KW - BeautifulSoup
KW - Python
KW - algorithm
KW - element fill-in-blank problem
KW - regular expression
KW - web-client programming
UR - http://www.scopus.com/inward/record.url?scp=85179885163&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85179885163&partnerID=8YFLogxK
U2 - 10.1109/ICCE-Asia59966.2023.10326341
DO - 10.1109/ICCE-Asia59966.2023.10326341
M3 - Conference contribution
AN - SCOPUS:85179885163
T3 - 2023 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2023
BT - 2023 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2023
Y2 - 23 October 2023 through 25 October 2023
ER -