Using an automatic marking system for programming courses

All students (about 1000) at Sapporo Gakuin University are required to take a Computer Literacy course. At Hokkaido University, we teach courses, such as AI Programming, with approximately 100 students. By using automatic marking systems of our own design we can check student work and obtain the results immediately. It reduces our labor, enables us to grasp individual students' learning states, and allows us to tailor our instruction to each student's needs. Automatic marking is a key technology for determining the current individual learning state of each student in a large class. By using automatic marking we can conduct short tests many times, mark the tests automatically, and collect detailed information about the learning states of students from the test results. However, developing reliable and efficient marking systems is a difficult and time-consuming job using conventional methods. In this paper, we introduce our automatic marking systems, share our experiences developing and using the systems in our classes, and discuss the possibility of expanding its use to object-oriented programming language courses.

[1]  Kiyoshi Akama,et al.  Equivalent Transformation by Safe Extension of Data Structures , 2001, Ershov Memorial Conference.

[2]  Kiyoshi Akama,et al.  Dynamic Interaction of Syntactic and Semantic Analyses Based on the Equivalent Transformation Computation Model , 2006, J. Adv. Comput. Intell. Intell. Informatics.

[3]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[4]  Chutiporn Anutariya,et al.  RDF Declarative Description (RDD): A Language for Metadata , 2001, J. Digit. Inf..

[5]  Chutiporn Anutariya,et al.  A Data Model for XML Databases , 2001, Journal of Intelligent Information Systems.

[6]  Chutiporn Anutariya,et al.  Toward reasoning with unified modeling language diagrams based on extensible markup language declarative description theory , 2004, Int. J. Intell. Syst..

[7]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[8]  Kiyoshi Akama,et al.  A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation , 2001, RULE@PLI.

[9]  Kiyoshi Akama,et al.  Program Synthesis Based on the Equivalent Transformation Computation Model , 2002, LOPSTR.

[10]  Kiyoshi Akama,et al.  Developing an e-learning System which enhances students' academic motivation , 2005, SIGUCCS '05.

[11]  K. Akama,et al.  A programming language interpreter system based on equivalent transformation , 2005, 2005 IEEE International Conference on Intelligent Engineering Systems, 2005. INES '05..

[12]  Kiyoshi Akama,et al.  Formalization of the Equivalent Transformation Computation Model , 2006, J. Adv. Comput. Intell. Intell. Informatics.