C B
|
|
|
- きのこ かせ
- 4 years ago
- Views:
Transcription
1 C B
2 1 LEVE LEVEL LEVEL LEVEL LEVEL LEVEL LEVEL LEVEL LEVEL LEVEL LEVEL LEVEL LEVEL
3 1 LEVE1 1.1 LEVEL , Pointer.c Pointer.c 01 #include <stdio.h> #define ARRAY_SIZE int main(int argc, char** argv) { 06 int i; 07 int array[array_size]; 08 int *int_pointer = array; unsigned char *memory = (unsigned char*)array; int\_pointer[0] = 0x ; // 15 for(i=0; i<sizeof(array); i+=4) { 16 printf("%016lx: %02x %02x %02x %02x \n", 17 (long unsigned int)(memory+i), 18 memory[i], memory[i+1], memory[i+2], memory[i+3]); 19 } 20 return 0; 21 } Pointer.c bffff9b4: bffff9b8: c0 04 e0 8f bffff9bc: 0c f5 e2 8f bffff9c0: bffff9c4: bffff9c8: bffff9cc: bc 05 e0 8f bffff9d0:
4 < > 1. Pointer.c (a) 03 ARRAY SIZE=8 (b) 0608 i. 07 ii..array int pointer (c) 10 unsigned (d) 10 int array char array memory (e) (a) 15 i sizeof(array) (b) 15 i=+4 int byte +4 (c) 17 memory int (d) 18 memory memory 6. 3
5 Pointer.c int Pointer.c 10 int_pointer[0] = 0x ; 11 *(int_pointer+1) = 0xFF000001; 12 *(int_pointer+2) = 0xFF000002; // bffff9b4: bffff9b8: ff bffff9bc: ff bffff9c0: bffff9c4: bffff9c8: bffff9cc: bc 05 e0 8f Pointer.c < > 1. (a) 11,12 (b) 11 int pointer 0xFF (c) 12 int pointer 0xFF (d) int pointer int 2. 02, xFF bffff9b bffff9b8 4. 0xFF bffff9b bffff9bc 5. int n 4n 6. int 4
6 Pointer.c unsigned char 1 12 *(int_pointer+2) = 0xFF000002; 13 *( memory + 5) = 0xee; 14 *( memory + 6) = 0xdd; // bffff9b4: bffff9b8: 01 ee dd ff bffff9bc: ff bffff9c0: bffff9c4: bffff9c8: bffff9cc: bc 05 e0 8f bffff9d0: Pointer.c Pointer < > 1.. (a) 13,14 (b) 13 memory ee (c) 14 memory ff (d) memory unsigned char memory bffff9b4 (a) memory ee (b) ee bffff9b9 (c) memory ff (d) ff bffff9ba 4. unsigned char n n 5. unsigned char 5
7 1.2 LEVEL /Intel /Motorola / 6
8 1.3 LEVEL1.3 (printf add sub.c 01 #include<stdio.h> 02 // 03 int add(int x, int y) 04 { 05 return x + y; 06 } // 09 void add_sub(int x, int y, int *res_add, int *res_sub) 10 { 11 *res_add = x + y; 12 *res_sub = x - y; 13 } int main(int argc, char** argv) 17 { 18 printf("add(%d, %d) = %d\n", 2, 3, add(2,3)); int a,s; 21 add_sub(2, 3, &a, &s); printf("add_sub(%d, %d, &a, &s)\n", 2, 3); 24 printf("add = %d\n", a); 25 printf("sub = %d\n", s); 26 } 01 add(2, 3) = 5 02 add_sub(2, 3, &a, &s) 03 add = 5 04 sub = -1 add sub.c < > 1.. (a) 0306 add 7
9 i. 03 int ii. 05 return (b) 0813 add sub i. ii. 09 int int iii. 11 res add iv. 12 res sub (c) 1626 main i. 18 add printf ii. 20 iii. 21 add sub a,s iv. 23 printf v. 24 a vi. 25 s add add sub add sub 8
10 2 LEVEL2 2.1 LEVEL2.1 callback.c 01 #include <stdio.h> void DoCallback( int (*cbfunc)(int,int,int) ) // 04 //cbfunc int int 05 { 06 int ret = cbfunc(0, 1, 2); // 07 printf("callback function returned %d\n", ret); 08 } int MyCallbackFunc1(int l, int c, int r) 11 { 12 printf("mycallbackfunc1 is called\n"); 13 return l+c+r; 14 } int MyCallbackFunc2(int l, int c, int r) 17 { 18 printf("mycallbackfunc2 is called\n"); 19 return l-c-r; 20 } int main() 23 { 24 DoCallback(MyCallbackFunc1); 25 DoCallback(MyCallbackFunc2); 26 } 01 MyCallbackFunc1 is called 02 callback function returned 3 03 MyCallbackFunc2 is called 04 callback function returned -3 callback.c < > 1. (a) 0308 DoCollback i. 03 ii. 06 9
11 iii. 06 int ret cbfunc(0,1,2) iv. 07 ret (b) 1014 MyCollbackFunc1 i. ii. 10 int iii. 12 iv. 13 return (c) C.1620 MyCollbackFunc2 i. ii. 16 int iii. 18 iv. 19 return (d) 2226 main i. ii. 24 DoCallback iii. 24 MyCollbackFunc1 iv. 25 DoCallback v. 25 MyCollbackFunc ,02 MyCollbackFunc ,04 MyCollbackFunc ///Main /// 02 ///DoCallback /// 03 ///MyCallbacFunc1 /// 04 MyCallbackFunc1 is called 05 ///DoCallback /// 06 callback function returned 3 07 ///Main /// 08 ///DoCallback /// 09 ///MyCallbacFunc1 /// 10 MyCallbackFunc2 is called 11 ///DoCallback /// 12 callback function returned ///Main /// callback.c 5. (a) i. DoCollback 01 main 10
12 ii. cbfunc MyCollbackFunc1 02 DoCollback iii. 06 MyCollbackFunc1 02 DoCollback iv. MyCollbackFunc1 03,04 MyCollbackFunc1 v. int ret 05 DoCollback vi DoCollback vii. DoCollback 06 main viii. cbfunc MyCollbackFunc2 07 DoCollback ix. 06 MyCollbackFunc2 08 DoCollback x. MyCollbackFunc1 09,10 MyCollbackFunc2 xi. int ret 11 DoCollback xii DoCollback xiii. main return 13 main (b) DoCallback MyCallbackFunc 11
13 2.2 LEVEL # ## callback3main.c 01 #include<stdio.h> 02 /* 03 "printf" 04 */ void searchstring(char*); int main(void) 09 { 10 searchstring("printf"); return 0; 13 } callback3sub.c 01 /* */ #include <stdio.h> 06 #include <string.h> #define BUF_SIZE void searchstring(char* str) 11 { 12 char buf[buf_size]; while(fgets(buf, BUF_SIZE, stdin)) { 15 /* strstr( NULL. 12
14 19 NULL 20 */ 21 if(strstr(buf, str)!= NULL) { 22 printf("%s", buf); 23 } 24 } 25 } 01 moano 02 n3e 03 printf 04 printf 05 fano 06 joeprintf 07 joeprintf 08 printmoe callback3main.c callback3sub.c < > 1..callback3Main.c (a) 06 (b) 0813 main (c) 10 searchstring (d) printf 2. callback3sub.c (a) (b) 08 BUF SIZE 256 (c) 1025 searchstring (d) 10 *char str (e) 14 (f) buf 256 (g) (h) 22 str (i) 3. 03,04 06,07 printf 4. printf 13
15 09 searchstring("#"); callback3main.c callback3sub.c 20 */ 21 char* s = strstr(buf,str); 22 if(s == buf) { 23 printf("%s", buf); 01 enova 02 printf 03 no#an 04 #noane 05 #noane 06 m3o# callback3main.c callback3sub.c < > 1..callback3Main.c 09 (a) # callback3main 09 (b) main 2. callback3sub.c (a) (b) # # (c) 21 buf str s (d) 22 s buf (e) str (f) str 23 14
16 2.2.2 callback3bmain.c 01 #include <stdio.h> 02 #include <string.h> /* int (*callback)(char*) char* 09 */ 10 void searchwith(int (*callback)(char*) ); /* 13 line printf 1 14 */ 15 int iscontainprintf(char* line) { 16 return strstr(line, "printf")!= NULL; 17 /* 18 if(strstr(line, "printf")!= NULL) 19 return 1; 20 else 21 return 0; 22 */ 23 } /* (iscontainprintf) */ 26 int main(void) 27 { 28 searchwith(iscontainprintf); return 0; 31 } callback3bsub.c 01 #include <stdio.h> #define BUF_SIZE /*
17 08 09 (int (*callback)(char*) ) char* 10 callback callback 13 */ 14 void searchwith(int (*callback)(char*) ) 15 { 16 char buf[buf_size]; 17 while(fgets(buf, BUF_SIZE, stdin)) { 18 if(callback(buf)) { 19 printf("%s", buf); 20 } 21 } 22 } callback3bmain.c callback3bsub.c callback3main.c callback3sub.c < > 1. callback3bmain.c (a) (b) callback3bmain.c iscontainprintf main (c) 10 serchwith (d) 1523 iscontainprintf (e) 28 searchwith iscontainprintf 2. callback3bsub.c (a) (b) callback3bsub.c serchwith (c) 18 callback3bmain.c 15 int iscontainprintf(char* line) { 16 char* s = strstr(line,"#"); 17 return s == line; 18 /* 16
18 callback3bmain.c callback3bsub.c callback3main.c callback3sub.c < > 1. callback3bmain.c # printf # line # s s line 5. # 6. callback3bsub.c 7. callback3bsub.c 17
19 2.3 LEVEL2.3 callback4bsub.c callback4bsub.c callback4main.c 01 #include <stdio.h> int hasthree(int item); /* */ 06 void printonfound(int item) 07 { 08 printf("%d is found.\n", item); 09 } /* */ 12 void indicateonfound(int item) 13 { 14 int i; 15 putchar( [ ); 16 for(i=0; i<item; i++) { 17 putchar( * ); 18 } 19 puts("]"); 20 } 21 /**/ 22 int main(void) 23 { 24 int i=0; 25 int j=0; 26 int data1[] = {0,1,2,3,4,5,6,7,8,9,10,-1}; 27 int data2[] = {3,6,8,13,5,27,0,6,2,34,63,123,65,-1}; while(1){ 30 int num = data2[i]; 31 if(hasthree(num)) 32 printonfound(num); 33 i++; 34 if(num == -1) break; 35 } while(1){ 38 int num = data1[j]; 18
20 39 if(hasthree(num)) 40 indicateonfound(num); 41 j++; 42 if(num == -1) break; 43 } return 0; 46 } callback4sub.c 01 include <stdio.h> //3 04 int hasthree(int item) 05 { 06 return (item % 3 == 0 item % 10 == 3 item /10 == 3); 07 } 01 3 is found is found is found is found is found is found is found is found is found. 10 [] 11 [***] 12 [******] 13 [*********] callback4main.c callback4sub.c < > 1. callback4bmain.c (a) callback4bmain.c printonfound indicateonfound main (b) 03 hasthree (c) 0609 printonfound i. 19
21 ii. 06 int iii. 08 (d) 1220 indicateonfound i. ii. 12 int iii * (e) 2246 main i. ii iii pintonfound while iv. 30 i num v. 31 num 3 hathree vi. 32 printonfound vii. 34 numi -1 while viii indicateonfound while ix callback4bsub.c (a) callback4bsub.c hasthree (b) 0407 hasthree i. 04 int ii iii. 3. (a) Sub (b) (c) main (d) Main 20
22 2.4 LEVEL2.4 Level2.3 callback4bmain.c maia main while while callback4bsub.c main main 2.5 LEVEL2.5 callback4bmain.c 01 #include <stdio.h> void findnumber(int array[]); 04 void registercallback(int (*callback)(int) ); int hasthree(int item) 08 { 09 return (item % 3 == 0 item % 10 == 3 item /10 == 3); 10 } int hastwo(int item) 13 { 14 return (item % 2 == 0 item % 10 == 2 item /10 == 2); 15 } /**/ 18 int main(void) 19 { 20 /* -1 */ 21 int data1[] = {0,1,2,3,4,5,6,7,8,9,10, -1}; 22 int data2[] = {3,6,8,13,5,27,0,6,2,34,63,123,65, -1}; registercallback(hasthree); findnumber(data1); registercallback(hastwo); 21
23 30 31 findnumber(data2); return 0; 34 } callback4bsub.c 01 #include <stdio.h> static int (*onfoundfuncpointer)(int) = NULL; void registercallback(int (*callback)(int) ) 06 { 07 onfoundfuncpointer = callback; 08 } void findnumber(int array[]) 11 { 12 int i=0; 13 while(array[i]!= -1) { 14 if(onfoundfuncpointer(array[i]) ) { 15 printonfound(array[i]); 16 } 17 i++; 18 } 19 putchar( \n ); 20 } int printonfound(int item) 23 { 24 printf("%d is found.\n", item); 25 } 22
24 01 0 is found is found is found is found is found is found is found is found is found is found is found. callback4bmain.c callback4bsub.c < > 1. callback4bmain.c (a) int 04 (void (*callback)(int) ); (int (*callback)(int) ); (b) 0710 (c) Main (d) 1215 (e) 0710 (f) 25 (printonfound) (hasthree) (g) callback4bsub.c (a) int 03 void (*onfoundfuncpointer) int (*onfoundfuncpointer) (b) int 05 (void (*callback)(int) ); (int (*callback)(int) ); (c) 14 hasthree(array[i]) onfoundfuncpointer(array[i]) (d) 15 onfoundfuncpointer(array[i]); printonfound(array[i]); (e) Main Sub 5. void int 23
25 3 LEVEL3 3.1 LEVEL3.1 glut.c GLUT glut.c 01 #include <GLUT/glut.h> 02 #include <stdio.h> // 05 void display(void) 06 { 07 printf("display\n"); 08 } // 11 void mouse(int button, int state, int x, int y) 12 { 13 if(state == GLUT_UP) { 14 printf("mouse up\n"); 15 }else{ 16 printf("mouse down\n"); 17 } 18 } // 21 void keyboard(unsigned char key, int x, int y) 22 { 23 printf("keyboard(%c)\n", key); 24 } int main(int argc, char *argv[]) 27 { 28 glutinit(&argc, argv); //glut 29 glutcreatewindow(argv[0]); //window // 32 glutdisplayfunc(display); //display 33 glutmousefunc(mouse); //mouse 34 glutkeyboardfunc(keyboard);//keyboard glutmainloop(); // 37 printf("exit\n"); 38 return 0; 39 } 24
26 01 display 02 mouse down 03 mouse up 04 keyboard(a) 05 keyboard(o) 06 keyboard(3) 07 )eyboard( glut.c < > 1. glut.c (a) 0509 display i. display (b) 1118 mouse i. 13 GLUT UP mouse up ii. mouse down (c) 2124 keyboard i. ii. (d) 2639 main i. 2. (a) 01 glut.c 32 (b) 02,03 (c) glut.c 33 glutmousefunc (d) 0406 (e) glut.c 34glutKeyboardFunc (f) 07 return(enter) (g) return (h) 36 25
27 3.2 LEVEL GUI
28
パソコン機能ガイド
PART12 ii iii iv v 1 2 3 4 5 vi vii viii ix P A R T 1 x P A R T 2 xi P A R T 3 xii xiii P A R T 1 2 3 1 4 5 1 6 1 1 2 7 1 2 8 1 9 10 1 11 12 1 13 1 2 3 4 14 1 15 1 2 3 16 4 1 1 2 3 17 18 1 19 20 1 1
パソコン機能ガイド
PART2 iii ii iv v 1 2 3 4 5 vi vii viii ix P A R T 1 x P A R T 2 xi P A R T 3 xii xiii P A R T 1 2 1 3 4 1 5 6 1 2 1 1 2 7 8 9 1 10 1 11 12 1 13 1 2 3 14 4 1 1 2 3 15 16 1 17 1 18 1 1 2 19 20 1 21 1 22
3 5 18 3 5000 1 2 7 8 120 1 9 1954 29 18 12 30 700 4km 1.5 100 50 6 13 5 99 93 34 17 2 2002 04 14 16 6000 12 57 60 1986 55 3 3 3 500 350 4 5 250 18 19 1590 1591 250 100 500 20 800 20 55 3 3 3 18 19 1590
™…
i 1 1 1 2 3 5 5 6 7 9 10 11 13 13 14 15 15 16 17 18 20 20 20 21 22 ii CONTENTS 23 24 26 27 2 31 31 32 32 33 34 37 37 38 39 39 40 42 42 43 44 45 48 50 51 51 iii 54 57 58 60 60 62 64 64 67 69 70 iv 70 71
i
i ii iii iv v vi vii viii ix x xi ( ) 854.3 700.9 10 200 3,126.9 162.3 100.6 18.3 26.5 5.6/s ( ) ( ) 1949 8 12 () () ア イ ウ ) ) () () () () BC () () (
7 i 7 1 2 3 4 5 6 ii 7 8 9 10 11 1 12 13 14 iii.......................................... iv................................................ 21... 1 v 3 6 7 3 vi vii viii ix x xi xii xiii xiv xv 26 27
9 i 9 1 2 3 4 5 6 ii 7 8 9 10 11 12 .......................................... iii ... 1... 1........................................ 9 iv... v 3 8 9 3 vi vii viii ix x xi xii xiii xiv 34 35 22 1 2 1
i ii iii iv v vi vii viii ix x xi xii xiii xiv xv xvi 2 3 4 5 6 7 $ 8 9 10 11 12 13 14 15 16 17 $ $ $ 18 19 $ 20 21 22 23 24 25 26 27 $$ 28 29 30 31 $ $ $ 32 33 34 $ 35 $ 36 $ 37 38 39 40 $ 41 42 43 44
:30 12:00 I. I VI II. III. IV. a d V. VI
2017 2017 08 03 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF X [ S ] a S S ; X X X, S [, a, ], ; BNF X (parse tree) (1) [a;a] (2) [[a]] (3) [a;[a]] (4) [[a];a] : [a] X 2 222222
困ったときのQ&A
ii iii iv NEC Corporation 1998 v C O N T E N T S PART 1 vi vii viii ix x xi xii PART 2 xiii PART 3 xiv P A R T 1 3 1 2 PART 3 4 2 1 1 2 4 3 PART 1 4 5 5 6 PART 1 7 8 PART 1 9 1 2 3 1 2 3 10 PART 1 1 2
SC-85X2取説
I II III IV V VI .................. VII VIII IX X 1-1 1-2 1-3 1-4 ( ) 1-5 1-6 2-1 2-2 3-1 3-2 3-3 8 3-4 3-5 3-6 3-7 ) ) - - 3-8 3-9 4-1 4-2 4-3 4-4 4-5 4-6 5-1 5-2 5-3 5-4 5-5 5-6 5-7 5-8 5-9 5-10 5-11
<4D6963726F736F667420506F776572506F696E74202D208376838C835B83938365815B835683878393312E707074205B8CDD8AB78382815B83685D>
i i vi ii iii iv v vi vii viii ix 2 3 4 5 6 7 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
エクセルカバー入稿用.indd
i 1 1 2 3 5 5 6 7 7 8 9 9 10 11 11 11 12 2 13 13 14 15 15 16 17 17 ii CONTENTS 18 18 21 22 22 24 25 26 27 27 28 29 30 31 32 36 37 40 40 42 43 44 44 46 47 48 iii 48 50 51 52 54 55 59 61 62 64 65 66 67 68
1... 1 2... 1 1... 1 2... 2 3... 2 4... 4 5... 4 6... 4 7... 22 8... 22 3... 22 1... 22 2... 23 3... 23 4... 24 5... 24 6... 25 7... 31 8... 32 9... 3
3 2620149 3 6 3 2 198812 21/ 198812 21 1 3 4 5 JISJIS X 0208 : 1997 JIS 4 JIS X 0213:2004 http://www.pref.hiroshima.lg.jp/site/monjokan/ 1... 1 2... 1 1... 1 2... 2 3... 2 4... 4 5... 4 6... 4 7... 22
01_.g.r..
I II III IV V VI VII VIII IX X XI I II III IV V I I I II II II I I YS-1 I YS-2 I YS-3 I YS-4 I YS-5 I YS-6 I YS-7 II II YS-1 II YS-2 II YS-3 II YS-4 II YS-5 II YS-6 II YS-7 III III YS-1 III YS-2
困ったときのQ&A
ii iii iv NEC Corporation 1997 v P A R T 1 vi vii P A R T 2 viii P A R T 3 ix x xi 1P A R T 2 1 3 4 1 5 6 1 7 8 1 9 1 2 3 4 10 1 11 12 1 13 14 1 1 2 15 16 1 2 1 1 2 3 4 5 17 18 1 2 3 1 19 20 1 21 22 1
I. Backus-Naur BNF : N N 0 N N N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) (2) (3) (4) II. 0(0 101)* (
2016 2016 07 28 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF : 11011 N N 0 N N 11 1001 N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) 1100100 (2) 1111011 (3) 1110010 (4) 1001011
活用ガイド （ハードウェア編）
(Windows 98) 808-877675-122-A ii iii iv NEC Corporation 1999 v vi PART 1 vii viii PART 2 PART 3 ix x xi xii P A R T 1 2 1 3 4 1 5 6 1 7 8 1 9 10 11 1 12 1 1 2 3 13 1 2 3 14 4 5 1 15 1 1 16 1 17 18 1 19
III
III 1 1 2 1 2 3 1 3 4 1 3 1 4 1 3 2 4 1 3 3 6 1 4 6 1 4 1 6 1 4 2 8 1 4 3 9 1 5 10 1 5 1 10 1 5 2 12 1 5 3 12 1 5 4 13 1 6 15 2 1 18 2 1 1 18 2 1 2 19 2 2 20 2 3 22 2 3 1 22 2 3 2 24 2 4 25 2 4 1 25 2
iii iv v vi vii viii ix 1 1-1 1-2 1-3 2 2-1 3 3-1 3-2 3-3 3-4 4 4-1 4-2 5 5-1 5-2 5-3 5-4 5-5 5-6 5-7 6 6-1 6-2 6-3 6-4 6-5 6 6-1 6-2 6-3 6-4 6-5 7 7-1 7-2 7-3 7-4 7-5 7-6 7-7 7-8 7-9 7-10 7-11 8 8-1
これわかWord2010_第1部_100710.indd
i 1 1 2 3 6 6 7 8 10 10 11 12 12 12 13 2 15 15 16 17 17 18 19 20 20 21 ii CONTENTS 25 26 26 28 28 29 30 30 31 32 35 35 35 36 37 40 42 44 44 45 46 49 50 50 51 iii 52 52 52 53 55 56 56 57 58 58 60 60 iv
パワポカバー入稿用.indd
i 1 1 2 2 3 3 4 4 4 5 7 8 8 9 9 10 11 13 14 15 16 17 19 ii CONTENTS 2 21 21 22 25 26 32 37 38 39 39 41 41 43 43 43 44 45 46 47 47 49 52 54 56 56 iii 57 59 62 64 64 66 67 68 71 72 72 73 74 74 77 79 81 84
これでわかるAccess2010
i 1 1 1 2 2 2 3 4 4 5 6 7 7 9 10 11 12 13 14 15 17 ii CONTENTS 2 19 19 20 23 24 25 25 26 29 29 31 31 33 35 36 36 39 39 41 44 45 46 48 iii 50 50 52 54 55 57 57 59 61 63 64 66 66 67 70 70 73 74 74 77 77
void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=
![void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=](/thumbs/89/97513163.jpg "void hash1_init(int *array) int i; for (i = 0; i < HASHSIZE; i++) array[i] = EMPTY; /* i EMPTY */ void hash1_insert(int *array, int n) if (n < 0 n >=")
II 14 2018 7 26 : : proen@mm.ics.saitama-u.ac.jp 14,, 8 2 12:00 1 O(1) n O(n) O(log n) O(1) 32 : 1G int 4 250 M 2.5 int 21 2 0 100 0 100 #include #define HASHSIZE 100 /* */ #define NOTFOUND 0
Ｃ言語によるアルゴリズムとデータ構造
Algorithms and Data Structures in C 4 algorithm List - /* */ #include List - int main(void) { int a, b, c; int max; /* */ Ÿ 3Ÿ 2Ÿ 3 printf(""); printf(""); printf(""); scanf("%d", &a); scanf("%d",
第3章 OpenGL の基礎
3 OpenGL April 11, 2017 1 / 28 3.1 ( ) OpenGL OpenGL 2 / 28 3.2 OpenGL OpenGL OpenGL (Open Graphics Library) Silicon Graphics, Inc. 2 3 API (Application Program Interface) [4] UNIX OS Windows Macintosh
untitled
i ii iii iv v 43 43 vi 43 vii T+1 T+2 1 viii 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 a) ( ) b) ( ) 51
2
1 2 3 4 5 6 7 8 9 10 I II III 11 IV 12 V 13 VI VII 14 VIII. 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 _ 33 _ 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 VII 51 52 53 54 55 56 57 58 59
I
I II III IV V VI VII VIII IX X XI XII XIII XIV 1. 2 3 4 5 2. 6 7 8 3. 1 2 3 9 4 5 10 6 11 4. 1 2 3 1 2 12 1 2 3 1 2 3 13 14 1 2 1 15 16 1. 20 1 21 1 22 23 1 2 3 4 24 1 2 ok 25 1 2 26 1 2 3 27 2. 28
平成18年版 男女共同参画白書
i ii iii iv v vi vii viii ix 3 4 5 6 7 8 9 Column 10 11 12 13 14 15 Column 16 17 18 19 20 21 22 23 24 25 26 Column 27 28 29 30 Column 31 32 33 34 35 36 Column 37 Column 38 39 40 Column 41 42 43 44 45
:30 12:00 I. I VI II. III. IV. a d V. VI
2018 2018 08 02 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF N N y N x N xy yx : yxxyxy N N x, y N (parse tree) (1) yxyyx (2) xyxyxy (3) yxxyxyy (4) yxxxyxxy N y N x N yx
I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) + x * x + x x (4) * *
2015 2015 07 30 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) +
ohp03.dvi
19 3 ( ) 2019.4.20 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void int main(int argc, char *argv[]) {... 2 (2) argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0
Step2 入門
ii iii iv v vi NEC Corporation 1999 vii C O N T E N T S PART 1 PART 2 PART 3 viii PART 4 ix C O N T E N T S PART 5 x PART 6 xi C O N T E N T S PART 7 xii PART 8 PART 9 xiii C O N T E N T S xiv xv PART
PowerPoint Presentation
p.130 p.198 p.208 2 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i i < NUM; i++ ) ) if if ( weight[i] > max ) max = weight[i]: if if ( weight[i] < min ) min = weight[i]: weight
01_SWGuide_V8.50.fm
ii iii iv v 2 vi vii viii ix x xi xii xiii xiv xv xvi xvii 1 CHAPTER 1-1 1-2 1-3 2 CHAPTER 2-1 2-2 2-3 2-4 1 2 2-5 3 4 2-6 5 6 2-7 7 8 2-8 9 2-9 10 11 2-10 12 13 2-11 14 15 2-12 16 17 18 2-13 1 2 2-14
1... 1 1... 1 2... 1 3... 1 4... 4 5... 7 6... 7 7... 12 8... 12 9... 13 10... 13 11... 13 12... 14 2... 14 1... 14 2... 16 3... 18 4... 19 5... 19 6.
3 2620149 1 3 8 3 2 198809 1/1 198809 1 1 3 4 5 JISJIS X 0208 : 1997 JIS 4 JIS X 0213:2004 http://www.pref.hiroshima.lg.jp/site/monjokan/ 1... 1 1... 1 2... 1 3... 1 4... 4 5... 7 6... 7 7... 12 8... 12
r07.dvi
19 7 ( ) 2019.4.20 1 1.1 (data structure ( (dynamic data structure 1 malloc C free C (garbage collection GC C GC(conservative GC 2 1.2 data next p 3 5 7 9 p 3 5 7 9 p 3 5 7 9 1 1: (single linked list 1
ii iii iv CON T E N T S iii iv v Chapter1 Chapter2 Chapter 1 002 1.1 004 1.2 004 1.2.1 007 1.2.2 009 1.3 009 1.3.1 010 1.3.2 012 1.4 012 1.4.1 014 1.4.2 015 1.5 Chapter3 Chapter4 Chapter5 Chapter6 Chapter7
ohp07.dvi
19 7 ( ) 2019.4.20 1 (data structure) ( ) (dynamic data structure) 1 malloc C free 1 (static data structure) 2 (2) C (garbage collection GC) C GC(conservative GC) 2 2 conservative GC 3 data next p 3 5
joho07-1.ppt
0xbffffc5c 0xbffffc60 xxxxxxxx xxxxxxxx 00001010 00000000 00000000 00000000 01100011 00000000 00000000 00000000 xxxxxxxx x y 2 func1 func2 double func1(double y) { y = y + 5.0; return y; } double func2(double*
1) OOP 2) ( ) 3.2) printf Number3-2.cpp #include <stdio.h> class Number Number(); // ~Number(); // void setnumber(float n); float getnumber();
: : :0757230G :2008/07/18 2008/08/17 1) OOP 2) ( ) 3.2) printf Number3-2.cpp #include class Number Number(); // ~Number(); // void setnumber(float n); float getnumber(); private: float num; ;
vi アハ ート2 アハ ート3 アハ ート4 アハ ート5 アハ ート6 アハ ート7 アハ ート8 アハ ート9 アハ ート10 アハ ート11 アハ ート12 アハ ート13 アハ ート14 アハ ート15 アハ ート16 アハ ート17 アハ ート18 アハ ート19 アハ ート20 アハ
iii vi アハ ート2 アハ ート3 アハ ート4 アハ ート5 アハ ート6 アハ ート7 アハ ート8 アハ ート9 アハ ート10 アハ ート11 アハ ート12 アハ ート13 アハ ート14 アハ ート15 アハ ート16 アハ ート17 アハ ート18 アハ ート19 アハ ート20 アハ ート21 アハ ート22 アハ ート23 vii アハ ート 24 アハ ート 25 アハ ート26
活用ガイド （ソフトウェア編）
(Windows 95 ) ii iii iv NEC Corporation 1999 v P A R T 1 vi P A R T 2 vii P A R T 3 P A R T 4 viii P A R T 5 ix x P A R T 1 2 3 1 1 2 4 1 2 3 4 5 1 1 2 3 4 6 5 6 7 7 1 1 2 8 1 9 1 1 2 3 4 5 6 1 2 3 4
r03.dvi
19 ( ) 019.4.0 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void... argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0 a a \0 b b b \0 c c c \0 1: // argdemo1.c ---
i ii iii iv v vi vii ( ー ー ) ( ) ( ) ( ) ( ) ー ( ) ( ) ー ー ( ) ( ) ( ) ( ) ( ) 13 202 24122783 3622316 (1) (2) (3) (4) 2483 (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) 11 11 2483 13
II ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 D
II 8 2003 11 12 1 6 ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 Daisuke 8 =>. 73 Daisuke 35 Hiroshi 64 Ichiro 87 Junko
P06.ppt
p.130 p.198 p.208 2 1 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i < NUM; i++ ) if ( weight[i] > max ) max = weight[i]: if ( weight[i] < min ) min = weight[i]: weight 3 maxof(a,
VB-C50i/VB-C50iR 使用説明書
a ii iii iv a v vi vii viii d a a d ix a a d b a a a b x a a g a g a e a a xi a a a xii a a xiii xiv 1-2 1-3 d 1-4 1-5 1-6 1-7 1-8 1-9 1-10 1-11 1-12 2-2 2-3 a 2-4 a 2-5 a 2-6 2-7 2-8 2-9 2-10 2-11 2-12
#include <stdio.h> 2 #include <stdlib.h> 3 #include <GL/glut.h> 4 Program 1 (OpenGL GameSample001) 5 // 6 static bool KeyUpON = false; // 7 sta
1 1. 1 #include 2 #include 3 #include 4 Program 1 (OpenGL GameSample001) 5 // 6 static bool KeyUpON = false; // 7 static bool KeyDownON = false; // 8 static bool KeyLeftON
活用ガイド （ソフトウェア編）
(Windows 98 ) ii iii iv v NEC Corporation 1999 vi P A R T 1 P A R T 2 vii P A R T 3 viii P A R T 4 ix P A R T 5 x P A R T 1 2 3 1 1 2 4 1 2 3 4 5 1 1 2 3 4 5 6 6 7 7 1 1 2 8 1 9 1 1 2 3 4 5 6 1 2 3 10
‚æ4›ñ
( ) ( ) ( ) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 (OUS) 9 26 1 / 28 ( ) ( ) ( ) A B C D Z a b c d z 0 1 2 9 (OUS) 9
/ SCHEDULE /06/07(Tue) / Basic of Programming /06/09(Thu) / Fundamental structures /06/14(Tue) / Memory Management /06/1
I117 II I117 PROGRAMMING PRACTICE II 2 MEMORY MANAGEMENT 2 Research Center for Advanced Computing Infrastructure (RCACI) / Yasuhiro Ohara yasu@jaist.ac.jp / SCHEDULE 1. 2011/06/07(Tue) / Basic of Programming
( ) 1 1: 1 #include <s t d i o. h> 2 #include <GL/ g l u t. h> 3 #include <math. h> 4 #include <s t d l i b. h> 5 #include <time. h>
2007 12 5 1 2 2.1 ( ) 1 1: 1 #include 2 #include 3 #include 4 #include 5 #include 6 7 #define H WIN 400 // 8 #define W WIN 300 // 9
活用ガイド (ソフトウェア編)
ii iii iv NEC Corporation 1998 v vi PA RT 1 vii PA RT 2 viii PA RT 3 PA RT 4 ix P A R T 1 2 3 1 4 5 1 1 2 1 2 3 4 6 1 2 3 4 5 7 1 6 7 8 1 9 1 10 1 2 3 4 5 6 7 8 9 10 11 11 1 12 12 1 13 1 1 14 2 3 4 5 1
リファレンス
STEP1 STEP 2 STEP 3 ii iii iv v NEC Corporation 1998 vi C O N T E N T S P A R T 1 viii ix C O N T E N T S P A R T 2 x P A R T 3 xi C O N T E N T S P A R T 4 xii P A R T 5 xiii C O N T E N T S P A R T
‚æ2›ñ C„¾„ê‡Ìš|
I 8 10 10 I ( 6 ) 10 10 1 / 23 1 C ( ) getchar(), gets(), scanf() ( ) putchar(), puts(), printf() 1 getchar(), putchar() 1 I ( 6 ) 10 10 2 / 23 1 (getchar 1 1) 1 #include 2 void main(void){ 3 int
r08.dvi
19 8 ( ) 019.4.0 1 1.1 (linked list) ( ) next ( 1) (head) (tail) ( ) top head tail head data next 1: NULL nil ( ) NULL ( NULL ) ( 1 ) (double linked list ) ( ) 1 next 1 prev 1 head cur tail head cur prev
18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf("hello World\n"); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o
![18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf(hello World\n); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o](/thumbs/95/124976715.jpg "18 C ( ) hello world.c 1 #include <stdio.h> 2 3 main() 4 { 5 printf(hello World\n); 6 } [ ] [ ] #include <stdio.h> % cc hello_world.c %./a.o")
18 C ( ) 1 1 1.1 hello world.c 5 printf("hello World\n"); 6 } [ ] [ ] #include % cc hello_world.c %./a.out Hello World [a.out ] % cc hello_world.c -o hello_world [ ( ) ] (K&R 4.1.1) #include
& & a a * * ptr p int a ; int *a ; int a ; int a int *a
int a = 123; a 123 :100 a 123 int *ptr = & a; a ptr ptr a 100 a 123 200 *ptr 200 a & & a a * * ptr p --------------------------------------------------------------------------------------------- int a
SPP24_Program_WOC(J)-15
9:00-9:10 9:20-10:00 Invited Lecture A1-01-I 1 10:00-10:20 A1-02 3 10:20-10:40 A1-03 5 9:20-9:40 B1-01 7 9:40-10:00 B1-02 9 10:00-10:20 B1-03 11 10:20-10:40 B1-04 13 - i - 11:00-12:00 Plenary Lecture S-01
tuat1.dvi
( 1 ) http://ist.ksc.kwansei.ac.jp/ tutimura/ 2012 6 23 ( 1 ) 1 / 58 C ( 1 ) 2 / 58 2008 9 2002 2005 T E X ptetex3, ptexlive pt E X UTF-8 xdvi-jp 3 ( 1 ) 3 / 58 ( 1 ) 4 / 58 C,... ( 1 ) 5 / 58 6/23( )
『戦時経済体制の構想と展開』
1 15 15 17 29 36 45 47 48 53 53 54 58 60 70 88 95 95 98 102 107 116 v 121 121 123 124 129 132 142 160 163 163 168 174 183 193 198 205 205 208 212 218 232 237 237 240 247 251 vi 256 268 273 289 293 311
ohp08.dvi
19 8 ( ) 2019.4.20 1 (linked list) ( ) next ( 1) (head) (tail) ( ) top head tail head data next 1: 2 (2) NULL nil ( ) NULL ( NULL ) ( 1 ) (double linked list ) ( 2) 3 (3) head cur tail head cur prev data
1 1. Program 1 OpenCV (OpenCV Sample001) 1 /* 2 - > - > - >VC++ 3 ( ) 4 C:\opencv\build\include 5 ( ) 6 C:\opencv\build\x86\vc10\lib 7 - > - > - > - >
1 1. Program 1 OpenCV (OpenCV Sample001) 1 /* 2 - > - > - >VC++ 3 ( ) 4 C:\opencv\build\include 5 ( ) 6 C:\opencv\build\x86\vc10\lib 7 - > - > - > - > 8 (240 O p e n C V ) 9 opencv_core240d.lib 10 opencv_imgproc240d.lib
ex12.dvi
1 0. C, char., char, 0,. C, ("),., char str[]="abc" ; str abc.,, str 4. str 3. char str[10]="abc" ;, str 10, str 3., char s[]="abc", t[10] ;, t = s. ASCII, 0x00 0x7F, char., "abc" 3, 1. 1 8 256, 2., 2
困ったときのQ&A
Help i 1 ii iii v iv 2 C Alt Delete v iv vii vi vii vi viii ix x x xi 1 2 3 4 5 xii xiii xiv xv xvi xvii c c c xviii xix P A R T 1 P A R T 2 xx P A R T 3 xxi P A R T 4 xxii xxiii P A R T 1 2 1 1 2 3
$ ls -l $ ls -l -a $ ls -la $ ls -F $ ls <dirname> <dirname> $ cd <dirname> <dirname> $ cd $ pwd $ cat <filename> <filename> $ less <filename> <filena
$ pwd /home1/t0/t0903 / / /home1/t0/t0903 / / /home1/t0/t0903 / /... ~ $ ls $ ls -a $ ls -l $ ls -l -a $ ls -la $ ls -F $ ls $ cd $ cd $ pwd $ cat
新・明解Ｃ言語 ポインタ完全攻略
2 1-1 1-1 /* 1-1 */ 1 int n = 100; int *p = &n; printf(" n %d\n", n); /* n int */ printf("*&n %d\n", *&n); /* *&n int */ printf(" p %p\n", p); /* p int * */ printf("&*p %p\n", &*p); /* &*p int * */ printf("sizeof(n)
（報告書まとめ 2004/03/ ）
- i - ii iii iv v vi vii viii ix x xi 1 Shock G( Invention) (Property rule) (Liability rule) Impact flow 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 (
20 2008 ( bone collar Hematoxlyin-Eosin staining Alizarin Red S / Alcian Blue staining 1
長崎県地域防災計画
i ii iii iv v vi vii viii ix - 1 - - 2 - - 3 - - 4 - - 5 - - 6 - - 7 - - 8 - - 9 - 玢 - 10 - - 11 - - 12 - - 13 - - 14 - - 15 - - 16 - - 17 - - 18 - - 19 - - 20 - - 21 - - 22 - - 23 - - 24 - - 25 - -
橡Pro PDF
1 void main( ) char c; /* int c; */ int sum=0; while ((c = getchar())!= EOF) if(isdigit(c) ) sum += (c-'0'); printf("%d\n", sum); main()int i,sum=0; for(i=0;i
1.ppt
/* * Program name: hello.c */ #include int main() { printf( hello, world\n ); return 0; /* * Program name: Hello.java */ import java.io.*; class Hello { public static void main(string[] arg)
第3章 OpenGL の基礎
3 OpenGL April 20, 2012 1 / 23 31 ( ) OpenGL OpenGL 2 / 23 32 OpenGL OpenGL OpenGL (Open Graphics Library) Silicon Graphics, Inc 2 3 API (Application Program Interface) [4] UNIX OS Windows Macintosh CAD
困ったときのQ&A
Help i 1 ii iii v iv 2 C Alt Delete v iv vii vi vii vi viii ix x http://121ware.com/support/ 0120-977-121 x xi xii xii xii 1 2 3 4 5 xiii xiv xv xvi xvii xviii xix xx P A R T 1 P A R T 2 xxi P A R T 3
i
14 i ii iii iv v vi 14 13 86 13 12 28 14 16 14 15 31 (1) 13 12 28 20 (2) (3) 2 (4) (5) 14 14 50 48 3 11 11 22 14 15 10 14 20 21 20 (1) 14 (2) 14 4 (3) (4) (5) 12 12 (6) 14 15 5 6 7 8 9 10 7
I ASCII ( ) NUL 16 DLE SP P p 1 SOH 17 DC1! 1 A Q a q STX 2 18 DC2 " 2 B R b
I 4 003 4 30 1 ASCII ( ) 0 17 0 NUL 16 DLE SP 0 @ P 3 48 64 80 96 11 p 1 SOH 17 DC1! 1 A Q a 33 49 65 81 97 113 q STX 18 DC " B R b 34 50 66 8 98 114 r 3 ETX 19 DC3 # 3 C S c 35 51 67 83 99 115 s 4 EOT
(search: ) [1] ( ) 2 (linear search) (sequential search) 1
![(search: ) [1] ( ) 2 (linear search) (sequential search) 1](/thumbs/97/131825822.jpg "(search: ) [1] ( ) 2 (linear search) (sequential search) 1")
2005 11 14 1 1.1 2 1.2 (search:) [1] () 2 (linear search) (sequential search) 1 2.1 2.1.1 List 2-1(p.37) 1 1 13 n
C ontents VI VII
I ntroduction C ontents IV V C ontents VI VII C ontents VIII IX C ontents X XI C ontents XII XIII C ontents XIV XV XVI 01 192 193 02 C olumn 194 195 C olumn C olumn 196 197 03 C olumn C olumn C olumn