Abstract—Code reading is very important in programming educations for students. Through reading and analyzing high quality codes, they can study how to write a proper code and modify it with given specification. To assist with the studies of Java code reading, we proposed the value trace problem in Web-based Java Programming Learning Assistant System (JPLAS). JPLAS has been developed to provide self-learning environments to students by our group. This value trace problem asks students to trace the actual values of important variables in a Java code implementing a fundamental data structure or an algorithm. In this paper, we study value trace problems for graph theory algorithms. First, using the Dijkstra algorithm, we analyze the requirements and points in a value trace problem for this representative graph theory algorithm. Then, we generate problems for the two graph theory algorithms to examine their problem size and the effectiveness in Java programming studies. Our evaluation results show that value trace problems for graph theory algorithms are viable learning tools for algorithm understanding and code reading whereas additional tools are necessary for code writing.
Index Terms—Java programming, JPLAS, code reading,
value trace problem, graph theory algorithm.
N. Funabiki, K. K. Zaw, and M. Kuribayashi are with the Department of
Electrical and Communication Engineering, Okayama University, Okayama,
Japan (e-mail: funabiki@okayama-u.ac.jp).
W.-C. Kao is with the Department of Electrical Engineering, National
Taiwan Normal University, Taipei, Taiwan (e-mail:
jungkao68@gmail.com).
Cite: Nobuo Funabiki, Khin Khin Zaw, Minoru Kuribayashi, and Wen-Chung Kao, "Value Trace Problems for Graph Theory Algorithms in Java Programming Learning Assistant System," International Journal of Information and Education Technology vol. 7, no. 5, pp. 374-379, 2017.