Analysis of C-Programming Iteration Type Courseware by Mahalanobis-Taguchi System

Abstract

In this paper, it is proposed for the classification of the Mahalanobis distance of learning data in the C-programming iteration type courseware that a virtual teacher group is used as a standard space and that the membership function is used to convert learning time. Furthermore, a quantitative analysis method of the questions in the courseware is proposed by calculating the SN ratio allocating the Mahalanobis distance into the orthogonal arrays. The validity of the results by these proposed methods is confirmed by the measured values, and the causes for taking a long learning time are cleared.