JAIST Reposi Title オブジェクト指向言語における変数とデータの関係を理解するためのワークベンチ Author(s) 三浦, 元喜 ; 杉原, 太郎 ; 國藤, 進 Citation 情報処理学会論文誌, 50(10): Iss

Size: px

Start display at page:

Download "JAIST Reposi Title オブジェクト指向言語における変数とデータの関係を理解するためのワークベンチ Author(s) 三浦, 元喜 ; 杉原, 太郎 ; 國藤, 進 Citation 情報処理学会論文誌, 50(10): Iss"

ゆりかしもね
5 years ago
Views:

1 JAIST Reposi Title オブジェクト指向言語における変数とデータの関係を理解するためのワークベンチ Author(s) 三浦, 元喜 ; 杉原, 太郎 ; 國藤, 進 Citation 情報処理学会論文誌, 50(10): Issue Date Type Journal Article Text version publisher URL Rights 社団法人情報処理学会, 三浦元喜, 杉原太郎, 國藤進, 情報処理学会論文誌, 50(10), 2009, ここに掲載した著作物の利用に関する注意 : 本著作物の著作権は ( 社 ) 情報処理学会に帰属します本著作物は著作権者である情報処理学会の許可のもとに掲載するものですご利用に当たっては著作権法ならびに情報処理学会倫理綱領に従うことをお願いいたします Notice for the use of this material: The copyright of this mate retained by the Information Processi Japan (IPSJ). This material is publi web site with the agreement of the a the IPSJ. Please be complied with Co of Japan and the Code of Ethics of t any users wish to reproduce, make de work, distribute or make available t any part or whole thereof. All Right Copyright (C) Information Processing Japan. Description Japan Advanced Institute of Science and

2 Vol. 50 No (Oct. 2009) 1, Java C# Anchor Garden Anchor Garden Anchor Garden A Workbench for Understanding Relationship between Variable and Data in Object Oriented Programming Language Motoki Miura, 1, 1 Taro Sugihara 1 and Susumu Kunifuji 1 We propose Anchor Garden, an interactive workbench software to learn fundamentals of data structure with concepts of type, variable, object, and its relations in a strongly-typed object oriented programming language such as Java and C#. Learners can approach the concepts by a direct manipulation of graphical models. Anchor Garden (AG) allows the learners to create variables and objects, and to link among them. Since AG automatically generates source-code corresponding to the learner s manipulations, the learner can relate manipulations and representations of source code. Experimental result showed a tendency of learning effect with AG, and high correlations between the concept understanding and programming ability. Thus AG has a possibility to enhance the programming ability for novice programmers. 1. Java C# Jeliot3 1) JAWAA 2) 3 Alice 3) Scratch 4) Squeak etoy 5) Viscuit 6) Java C# Anchor Garden AG 1 School of Knowledge Science, Japan Advanced Institute of Science and Technology 1 Presently with Faculty of Engineering, Kyushu Institute of Technology 2396 c 2009 Information Processing Society of Japan

3 ) Alice 3),8) The Java Power Tools 9) PigWorld 10) Scratch 4) 11) Nigari 12) Java JavaMM 13) Nigari 2 JAWAA 2) Web Java Jeliot3 1),14) Java / PEN 15) BlueJ 16) Java UML UML UML NetBeans IDE UML AG 2 Myers INCENSE 17) jgrasp 18) AG AG 3 Campbell LIVE Languate-Independent Visualization Environment 19) LIVE C++ Java AG 3. Anchor Garden Anchor Garden AG AG AG / / GUI / / 3.1 AG 1 [Type] [Variable] [Object] 3 [Type] int String

4 Fig. 1 Initial Screen. 2 Fig. 2 Create Variables. 3 Fig. 3 Link to Objects. 4 Fig. 4 Linked. [Variable] [Object] Java int [Variable] 2 [Object] String [Object] [Object] 10 3 int String [str2/str3] int String 5 Object Oval

5 2399 SrcWin str1 = null; null new 2 String str1; 1 new String("Moji"); String str1 = new String("Moji"); Object obj1 Oval Oval oval1 obj1 = (Object) oval1; Fig. 5 5 Advanced mode and source code window. Rect String [Type] Object obj1 Oval Oval oval1 Object AG String 5 SrcWin 1 String str1; String new String("Moji"); 2 str1 2 str1 = new String("Moji"); 2 2 new String("Moji"); 1 2 str1 = new String("Moji"); str1 = "Moji"; new new str1 str2 str3 str1 = str2; str1 = str3; 4. AG 4.1 int int int[] intary1; intary1 = new int[4]; new new AG new = String str1 = new

2400 String("Moji"); 4.2 int String int AG String String 4.3 4.2 int for (int n = 0; n < intary1.length; n++){ intary2[n] = intary1[n]; String for (int n = 0; n < strary1.

6 2400 String("Moji"); 4.2 int String int AG String String int for (int n = 0; n < intary1.length; n++){ intary2[n] = intary1[n]; String for (int n = 0; n < strary1.length; n++){ strary2[n] = strary1[n]; 6 strary1 strary2 for (int n = 0; n < strary3.length; n++){ strary4[n] = new String(strAry3[n]); Java StringBuffer Point = 6 Fig. 6 Shallow copy and deep copy. 1 AG AG 1 (1) String (2) String (3) (4) 2 (5) String (6) String (7) String 2 (8) 1 2 AG String

2401 Table 1 1 Schedule of the experimental lecture. 4.4 7 Fig. 7 Swapping objects. 2 temp temp = str1; str1 = str2; str2 = temp; AG AG 2 String 2 String 7 5. AG 5.

7 2401 Table 1 1 Schedule of the experimental lecture Fig. 7 Swapping objects. 2 temp temp = str1; str1 = str2; str2 = temp; AG AG 2 String 2 String 7 5. AG 5.1 AG AG 1 [ ] A B 4/9 [3] 4/16 [3] 4/21 [1] 4/23 [3] 4/28 [1] (if) 4/30 [3] (while, for) 5/7 [3] 5/12 [1] (1) 60 (1) 30 5/12 [3] AG (1) 30 (1) 30 5/14 [3] (2) 5/19 [1] PPT 60 (2) 30 5/19 [3] PPT AG & 60 (2) 30 5/21 [3] (1) 5/26 [1] (2) 5/28 [3] 6/2 [1] C# Visual Studio int String if while for AG A B B A (1)

8 B AG 30 int int A (1) (1) (1) int int A A 3 B A B PowerPoint A B AG B AG B 3.1 int String String int int String String String String (2) (2) A.2 30 A 10 B A 5 26 AG Q1-1 1 Q1-2 Q2-1 1 Q2-2 Q3-1 Q3-2 AG Q3-3 Q AG A 5 B 7 A 50% B 87.5% A B A B B AG A 1 B AG A AG 0 B (1) (2) (1) (1) AG B B AG AG (1) (2) 2 B (1) (2) t AG

9 (1) (2) Table 2 Result of tests (1), (2). (1) 6 (2) 15 A B A B Table 3 Result of final test. Fig. 8 8 Relationship between learning times and test scores A B A B AG Visual Studio 4 (2) 1 5 (2) A t 5 t(16) = 1.64 p = t(16) = 2.04 p =0.063 AG AG AG B A B 1 8 AG

10 Pearson A n =10 * 5% ** 1% Table 4 Pearson s correlations of final test score (Group A) * * * * ** ** Pearson B n =8 * 5% ** 1% Table 5 Pearson s correlations of final test score (Group B) ** * ** ** * 0.84** [ 3] [ 5] AG AG 6. 2 AG AG AG 2 AG Java AnchorGarden URL ) Moreno, A., Myller, N., Sutinen, E. and Ben-Ari, M.: Visualizing Programs with Jeliot3, Proc. Advanced Visual Interfaces (AVI04 ), pp (2004). 2) Akingbade, A., Finley, T., Jackson, D., Patel, P. and Rodger, S.H.: JAWAA: Easy Web-Based Animation from CS 0 to Advanced CS Courses, Proc. 34th SIGCSE Technical Symposium on Computer Science Education, pp (2003). 3) Powers, K., Ecott, S. and Hirshfield, L.M.: Through the Looking Glass: Teaching CS0 with Alice, Proc. 38th SIGCSE Technical Symposium on Computer Science Education, pp (2007). 4) Maloney, J.H., Peppler, K., Kafai, Y., Resnick, M. and Rusk, N.: Programming by Choice: Urban Youth Learning Programming with Scratch, Proc. 39th SIGCSE Technical Symposium on Computer Science Education, pp (2008). 5) Kay, A.: Squeak Etoys Authoring & Media. articles/attach/etoys n authoring.pdf

11 2405 6) Viscuit 2004 pp (2004). 7) Vol.44, No.13, pp (2003). 8) Cooper, S., Dann, W. and Pausch, R.: Teaching Objects-first In Introductory Computer Science, Proc. 34th SIGCSE Technical Symposium on Computer Science Education, pp (2003). 9) Proulx, V.K., Raab, J. and Rasala, R.: Objects from the Beginning With GUIs, Proc. 7th Annual Conference on Innovation and Technology in Computer Science Education, pp (2002). 10) Lister, R.: Teaching Java First: Experiments with a Pigs-Early Pedagogy, Proc. 6th Conference on Australasian Computing Education, pp (2004). 11) Lawhead, P.B., Duncan, M.E., Bland, C.G., Goldweber, M., Schep, M., Barnes, D.J. and Hollingsworth, R.G.: A Road Map for Teaching Introductory Programming Using LEGO c Mindstorms Robots, ITiCSE-WGR 02: Working Group Reports from ITiCSE on Innovation and Technology in Computer Science Education, pp (2002). 12) Nigari Java Vol.45, No.9, pp (2004). 13) Cecchi, L., Crescenzi, P. and Innocenti, G.: C : C++ = JavaMM: Java, Proc. 2nd International Conference on Principles and Practice of Programming in Java (PPPJ2003 ), pp (2003). 14) Moreno, A. and Joy, M.S.: Jeliot 3 in a Demanding Educational Setting, Electronic Notes in Theoretical Computer Science (ENTCS), Vol.178, pp (2007). 15) PEN Vol.48, No.8, pp (2007). 16) Kölling, M., Quig, B., Patterson, A. and Rosenberg, J.: The BlueJ system and its pedagogy, Journal of Computer Science Education, Special Issue on Learning and Teaching Object Technology, Vol.13, No.4, pp (2003). 17) Myers, B.A.: INCENSE: A system for displaying data structures, SIGGRAPH Comput. Graph., Vol.17, No.3, pp (1983). 18) Cross, I.J.H., Hendrix, T.D., Jain, J. and Barowski, L.A.: Dynamic Object Viewers for Data Structures, Proc. 38th SIGCSE Technical Symposium on Computer Science Education, pp.4 8 (2007). 19) Campbell, A.E.R., Catto, G.L. and Hansen, E.E.: Language-Independent Interactive Data Visualization, Proc. 34th SIGCSE Technical Symposium on Computer Science Education, pp (2003). A.1 (1) Main { (1) 6 ary (2) 1 revary ( 3 ) for ary revary ary revary ary [0] [1] [2] [3] [4] [5] revary [0] [1] [2] [3] [4] [5] A.2 (2) 1 (1) int[] (2) String[] ( 3 ) StringBuilder (4) (5) 2 (// ) Console.WriteLine(" (Input A Sentence in English)."); String sentence = Console.ReadLine(); String[] words = sentence.split( );

12 2406 String[] copywords = // words for( int n = 0; n < words.length ; n++) { if (n % 2 == 0) { // copywords[n] words[n] else { // copywords[n] words[n] // int[] orig = new int[words.length]; for ( int n = 0; n < words.length ; n++) { orig[n] = words[n].length int[] copy = new int[words.length]; // for orig copy StringBuilder sb = new StringBuilder("A"); StringBuilder sbcopy = sb; sbcopy.append("bc"); 2 int[] nums = new int[]{2,3,4; 3 String[] ary = new String[]{"JAIST","KS"; (1) String[] abc = new String[]{"A","B","C"; String[] copy = new String[3]; for (int n = 0; n < 3; n++) { copy[n] = abc[n]; (2) String[] abc = new String[]{"A","B","C"; String[] copy = new String[3]; for (int n = 0; n < 3; n++) { copy[n] = new String(abc[n]); (3) StringBuilder[] abc = new StringBuilder[]{new StringBuilder("A"), new StringBuilder("B"), new StringBuilder("C"); StringBuilder[] copy = new StringBuilder[3]; for (int n = 0; n < 3; n++) { copy[n] = abc[n]; copy[0].append("x"); copy[1].append("y"); copy[2].append("z"); A static int GetSumAry(int[] ary) GetSumAry [2,3,5,4,6] =20 2 Main 10 (1) (2) (3) 3 1 (4)

13 2407 This is a pen. This pen. 3 Main 20 (1) 100 ary (2) ary 0 99 (3) 10 divary ary (4) ary 3 divary[3] 1 4 divary[4] divary[] divary[m] m ary m 3 9 (5) divary[3] [9] divary[3]= 38 : ************************************** divary[4]= 26 : ************************** divary[5]= 25 : ************************* divary[6]= 20 : ******************** divary[7]= 19 : ******************* divary[8]= 14 : ************** divary[9]= 11 : *********** 1 for / 10 ( 1 ) float[] (2) int[] ( 3 ) StringBuilder (4) (5) / StringBuilder sb = new StringBuilder("A"); StringBuilder sbcopy = sb; sbcopy.append("bc"); 2 int[] nums = new int[]{2,3,4; 3 String[] ary = new String[]{"JAIST","KS"; (1) String[] schools = new String[]{"IS","MS","KS"; String[] copy = new String[3]; copy[2] = schools[2]; (2) String[] schools = new String[3]; String[] copy = schools; schools[0] = "KS"; schools[1] = schools[0]; copy[2] = "IS"; (3) int[] nums = new int[]{1,2,3,4,5; int[] copy = new int[4]; for ( int n=0 ; n<4 ; n++) { copy[n] = nums[n] + nums[n + 1] ; (4) int[] orig = new int[]{2,4,6; int[] copy = orig;

14 2408 int[] backup = new int[3]; for ( int n=0 ; n<3 ; n++) { backup[n] = copy[n]; copy[1] = 8; ( ) ( ) ACM ACM IEEE CS ICOT DICOMO2008

1,a) 1,b) TUBSTAP TUBSTAP Offering New Benchmark Maps for Turn Based Strategy Game Tomihiro Kimura 1,a) Kokolo Ikeda 1,b) Abstract: Tsume-shogi and Ts

1,a) 1,b) TUBSTAP TUBSTAP Offering New Benchmark Maps for Turn Based Strategy Game Tomihiro Kimura 1,a) Kokolo Ikeda 1,b) Abstract: Tsume-shogi and Ts JAIST Reposi https://dspace.j Title ターン制戦略ゲームにおけるベンチマークマップの提案 Author(s) 木村, 富宏 ; 池田, 心 Citation ゲームプログラミングワークショップ 2016 論文集, 2016: 36-43 Issue Date 2016-10-28 Type Conference Paper Text version author

JAIST Reposi Title オブジェクト指向言語における変数とデータの関係を 理解するためのワークベンチ Author(s) 三浦, 元喜 ; 杉原, 太郎 ; 國藤, 進 Citation 情報処理学会論文誌, 50(10): Iss

JAIST Reposi Title オブジェクト指向言語における変数とデータの関係を理解するためのワークベンチ Author(s) 三浦, 元喜 ; 杉原, 太郎 ; 國藤, 進 Citation 情報処理学会論文誌, 50(10): Iss