• May 03, 2016 News! IJIET Vol. 5, No. 10 has been indexed by EI (Inspec).   [Click]
  • Mar 13, 2017 News!Vol. 7, No. 5 has been indexed by Crossref.
  • Mar 10, 2017 News!Vol. 7, No. 5 issue has been published online!   [Click]
General Information
    • ISSN: 2010-3689
    • Frequency: Bimonthly (2011-2014); Monthly (Since 2015)
    • DOI: 10.18178/IJIET
    • Editor-in-Chief: Prof. Dr. Steve Thatcher
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: EI (INSPEC, IET), Electronic Journals Library, Google Scholar, Crossref and ProQuest
    • E-mail: ijiet@ejournal.net
Editor-in-chief
Prof. Dr. Steve Thatcher
University of South Australia, Australia
It is my honor to be the editor-in-chief of IJIET. The journal publishes good papers which focous on the advanced researches in the field of information and education technology. Hopefully, IJIET will become a recognized journal among the scholars in the filed of information and education technology.
IJIET 2017 Vol.7(5): 374-379 ISSN: 2010-3689
doi: 10.18178/ijiet.2017.7.5.897

Value Trace Problems for Graph Theory Algorithms in Java Programming Learning Assistant System

Nobuo Funabiki, Khin Khin Zaw, Minoru Kuribayashi, and Wen-Chung Kao
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).

[PDF]

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.

Copyright © 2008-2016. International Journal of Information and Education Technology. All rights reserved.
E-mail: ijiet@ejournal.net