2) TA Hercules CAA 5 [6], [7] CAA BOSS [8] 2. C II C. ( 1 ) C. ( 2 ). ( 3 ) 100. ( 4 ) () HTML NFS Hercules ( )

Size: px

Start display at page:

Download "2) TA Hercules CAA 5 [6], [7] CAA BOSS [8] 2. C II C. ( 1 ) C. ( 2 ). ( 3 ) 100. ( 4 ) () HTML NFS Hercules ( )"

がんまいちぞの
7 years ago
Views:

1 1,a) 2 4 WC C WC C Grading Student programs for visualizing progress in classroom Naito Hiroshi 1,a) Saito Takashi 2 Abstract: To grade student programs in Computer-Aided Assessment system, we propose the method WC which is passed testing counts weighted by types of specifications for programming assignment. Comparing grade value between CAA system and teachers, teachers grade programs holisticly and change weights flexibility. By analyzing the association between grade and learning record data, method WC is a little better than not weighted method C. By questionnaire, teachers can not be concluded that either WC and C method are better but they think it s highly useful to display the progress using these methods. 1. TA TA 1 Department of Media Science, Faculty of Information Science and Technology, Osaka Institute of Technology 2 Department of Information Systems, Faculty of Information Science and Technology, Osaka Institute of Technology a) [email protected] computer-aided assessment, CAA [1], [2] CCA C CAA Hercules 2003 [3], C Java GUI [4] XML [5] Hercules ) 1

2 2) TA Hercules CAA 5 [6], [7] CAA BOSS [8] 2. C II C. ( 1 ) C. ( 2 ). ( 3 ) 100. ( 4 ) () HTML NFS Hercules ( )

) () 100 0 3 ( C ) WC C 2 5 WC 5 4 WC 57 C 53

3 2 WC C ( WC ) () ( C ) WC C 2 5 WC 5 4 WC 57 C 53 WC work

$= EOF) { data[i] = x; i++; N = i; if (N > 0) { max = data[0]; for (i = 1; i < N; i++) { if (data[i] > max) max = data[i]; printf("%d %d \n", N, max); return 0; 3 4 0 5 6 6 16 1 9 2 27 for 7 27 () 7 4$

4 #include <stdio.h> int main(void) { int data[100]; int N, x, i, max; i = 0; while (scanf("%d", &x)!= EOF) { data[i] = x; i++; N = i; if (N > 0) { max = data[0]; for (i = 1; i < N; i++) { if (data[i] > max) max = data[i]; printf("%d %d \n", N, max); return 0; for 7 27 () 7 4 WC C 12 WC C 1 while for for 8, ( 1 ) 8 1 ( 2 ) 12 1 for while for ( 3 ) 13 for 1 while 12 ( 4 ) 21 ( 5 ) 24 main void gcc ( 1 ) ( 2 ) ( 3 ) ( 4 ) WC C WC C WC 5. 4

5 WC 6 7 6 C 6 a2 WC C 6 5 6 5 WC5 WC1 5 1 SYA CMP

88 5 WC5+WC4 81 6 C5+C4 77 2 5 WC2 6 C4 a2 6 11 25

5 5 WC C 6 a2 WC C WC5 WC1 5 1 SYA CMP WC5+WC4 5 4 Updates 6 C5 C1 5 1 C5+C a WC5+WC C5+C WC2 6 C4 a WC5+WC4 8 C5+C () WC WC5 4 WC WC

6 9 WC 12 C 10 C 13 a2 11 WC X WC WC1 WC WC % WC C C WC C WC WC C WC Hercules ( WC) 27 6

7 ( 70 ) C II ) 2) 3) ( C) WC C WC C 20 C II [3] Vol. 2008, No. 13, pp (2008). [4] GUI Vol. 2008, No. 93, pp (2008). [5] VMA Vol. 24, pp (2009). [6] Olson, D. M.: The reliability of analytic and holistic methods in rating students computer programs, 9th SIGCSE technical symposium on Computer science education, pp (1988). [7] Smith, L. and Cordova, J.: Weighted primary trait analysis for computer program evaluation, Computer Science Education, Vol. 20, No. 6, pp (2005). [8] Joy, M., Griffiths, N. and Boyatt, R.: The BOSS online submission and assessment system, Educational Resources in Computing, Vol. 5, No. 3 (2005). [1] Ala-Mutka, K.: A Survey of Automated Assessment Approaches for Programming Assignments, Computer Science Education, Vol. 15, No. 2, pp (2005). [2] Douce, C., Livingstone, D. and Orwell, J.: Automatic test-based assessment of programming: A review, Educational Resources in Computing, Vol. 5, No. 3 (2005). 7

,,,,., C Java,,.,,.,., ,,.,, i

,,,,., C Java,,.,,.,., ,,.,, i 24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children