—Nowadays, C programming is essential for university students to study various programming languages, algorithms, and computer architecture. Previously, we have developed Java programming learning assistant system (JPLAS) for studying Java programming. JPLAS provides several types of exercise problems to cover different study stages, including the element fill-in-blank problem (EFP). An EFP instance asks students to fill in the blank elements in the given source code. The correctness of the answer is marked through string matching. In this paper, we study the EFP for C programming learning assistant system (CPLAS), by extending our works for JPLAS. To automatically generate a feasible EFP instance, the graph-based blank element selection algorithm is newly designed and implemented for C programming. For evaluations, we generate 19 EFP instances using C source codes for basic grammar concepts, and fundamental data structures and algorithms, and assign them to 42 students in a Myanmar university. The solving results confirm the effectiveness of EFP in detecting the students who may have difficulty in studying C programming and the hard topics for them.
|Number of pages||7|
|Journal||International Journal of Information and Education Technology|
|Publication status||Published - Jun 2021|
- Element fill-in-blank problem
- Index terms—C programming
ASJC Scopus subject areas
- Computer Science Applications