,,,,,,,,,, ( http: \ \ www. ncre. cn,, ) 30,,,,,,,, C : C : : 19 : : : /16 : : 96 : : : ISBN 7

Size: px

Start display at page:

Download "1 2005 9 2005,,,,,,,,,, ( http: \ \ www. ncre. cn,, ) 30,,,,,,,, C : C : : 19 : 100081 : : 7871092 1 /16 : 8. 75 : 96 : 2005 11 1 : 2005 11 1 : ISBN 7"

籍世
7 years ago
Views:

2 ,,,,,,,,,, ( http: \ \ www. ncre. cn,, ) 30,,,,,,,, C : C : : 19 : : : /16 : : 96 : : : ISBN /TP 8 :

3 ,,,, 1994 NCRE,,, ( ),,,,, ( C + + C JAVA Visual Basic) ( Access Visual FoxPro),, C : l; 2, ; 3, ; 4 C 2004, C : 50 ( ( 1) ( 10) 2, ( 11) ( 50) 1, 60 ), 20 ( 2, 40 ) 30, 10, 5 :,, ( 1 ),,,, ( 2 ),,, ( 3 ),,,,, ( 4 ),,,

4 ( ) 11 ( ) ( ) ( ) ( ) ( ) ( ) ( C ) ( C ) 8 (, 58 )

5 C,,,,,, * * *,, * * *

6 ( 1) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1) A) B) C) D) ( 2) A) B) C) D) ( 3) : A) ABCDEF B) DBEAFC C) ABDECF D) DEBFCA ( 4),,, A) B) C) D) ( 5) A) B) C) D) ( 6) A) B) C) D) ( 7), A), B), C) D) ( 8) ( ),, A) B) C) D) ( 9), A) ( 1) 1 ( 11 )

7 B), C), D), ( 10), ( ) A) B) C) D) ( 11), A) C, B), C) C D) C ( 12) a, A) a = A + 20 B) a - = a C) a = c + d D) a = c + d ( 13) # include < stdio. h > {int i = 010, j = 10; printf( " % d, % d", ++ i, j - - ) ; A) 11, 10 B) 9, 10 C) 010, 9 D) 10, 9 ( 14) C A) void define WORD B) a3_b3_123 IF C) for - - abc case D) 2a D0 sizeof ( 15)? A) a ++ ; B) a == b; C) a += b; D) a = 1, b = 1; ( 16) : int a = 8, b = 5, c; c = a / b ;, c A) 1. 4 B) 1 C) 2. 0 D) 2 ( 17) a int, : a = A ; A) a C B) a C) D) a A ASCII 1 ( 18) int a = 1234; printf( % 2d \ n, a) ; A) 12 B) 34 C) 1234 D) ( 19) C A) signed short int B) unsigned long int C) unsigned int D) long short ( 20) : int a, b, c, * d = &c; a b c A) scanf( % d% d% d, &a, &b, d) ; B) scanf( % d% d% d, &a, &b, &d) ; C) scanf( % d% d% d, a, b, d) ; D) scanf( % d% d% d, a, b, * d) ; ( 21) 16 C, long a;, a A) a = ; B) a = 4000* 10; C) a = ; D) a = 4000L* 10L; ( 22) A) define if B) define, if ( 1) 2 ( 11 )

$6; A) a C B) a C) D) a A ASCII 1 ( 18) int a = 1234; printf( % 2d \ n, a) ; A) 12 B) 34 C) 1234 D) ( 19) C A) signed short int B) unsigned long int C) unsigned int D) long short ( 20) : int a, b, c,$

8 C) if, define D) define if ( 23) : int a = 511, * b = &a; printf( % d \n, * b) ; A) B) a C) 512 D) 511 ( 24) { int a = 5, b = 4, c = 6, d; printf( ( % d \ n, d = a > b? ) ( a > c? a: c) : ( b) ) ; A) 5 B) 4 C) 6 D) ( 25), while { int i = 0; while ( i < 10) { if( i < 1) continue; if( i == 5) break; i ++ ; A) 1 B) 10 C) 6 D), ( 26) { int a = 0, i; for( i = 1; i < 5; i ++ ) { switch( i) { case 0: case 3: a += 2; case 1: case 2: a += 3; default: a += 5; printf( % d \ n, a) ; A) 31 B) 13 C) 10 D) 20 ( 27) { int a = 4, b = 5, c = 0, d; d =! a&&! b! c; printf( % d \ n, d) ; ( 1) 3 ( 11 )

$( 26) { int a = 0, i; for( i = 1; i < 5; i ++ ) { switch( i) { case 0: case 3: a += 2; case 1: case 2: a += 3; default: a += 5; printf( % d \ n,$

9 A) 1 B) 0 C) 0 D) - 1 ( 28) #include < stdio. h > { int i = 0, a = 0; while ( i < 20) { for( ; ; ) { if( ( i% 10) == 0) break; else i - - ; i += 11; a += i; printf( % d \ n, a) ; A) 21 B) 32 C) 33 D) 11 ( 29 ) char cchar( char ch) { if( ch >= A&&ch <= Z ) ch = ch - A + a ; return ch; { char s[ ] = " ABC + abc = defdef", * p = s; while( * p) { * p = cchar( * p) ; p ++ ; printf( % s\ n, s) ; A) abd + ABC = DEFdef B) abc + abc = defdef C) abcabcdefdef D) abcabcdefdef ( 30 ) int f( ) { static int i = 0; int s = 1 ; s += i; i ++ ; return s; ( 1) 4 ( 11 )

$p = s; while( * p) { * p = cchar( * p) ; p ++ ; printf( % s\ n, s) ; A) abd + ABC = DEFdef B) abc + abc = defdef C) abcabcdefdef D)$

10 { int i, a = 0 ; for( i = 0; i < 5; i ++ ) a += f( ) ; printf( % d \ n, a) ; A) 20 B) 24 C) 25 D) 15 ( 31 ) char s[ ] = \ \141 \141 abc \ t ; printf( % d \ n, strlen( s) ) ; A) 9 B) 12 C) 13 D) 14 ( 32 ) #include < stdio. h > void f( int n) ; { void f( int n) ; f( 5) ; void f( int n) { printf( % d \ n, n) ; A) f, f B) f, f C), ; f D) f, void ( 33 ) findmax findmax( int * a, int n) { int * p, * s; for ( p = a, s = a; p - a < n; p ++ ) if( ) s = p; return( * s) ; { int x[ 5] = {12, 21, 13, 6, 18 ; ( 1) 5 ( 11 )

$h > void f( int n) ; { void f( int n) ; f( 5) ; void f( int n) { printf( % d \ n, n) ; A) f, f B) f, f C), ; f D) f, void ( 33 )$

11 printf( % d \ n, findmax( x, 5) ) ; A) p > s B) * p > * s C) a[ p] > a[ s] D) p - a > p - s ( 34 ) { char ch[ 3 ] [ 5] = { AAAA, BBB, CC ; printf( \ % s \n, ch[ 1] ) ; A) AAAA B) BBB ( 35 ) C, C) BBBCC ( 1) 6 ( 11 ) D) CC A) auto B) register C) static D) extern ( 36 ) p, p, A) p = 2* ( int * ) malloc( sizeof( int) ) ; B) p = ( int * ) malloc( 2* sizeof( int) ) ; C) p = ( int * ) malloc( 2* 2) ; D) p = ( int * ) malloc( 2, sizeof( int) ) ; ( 37 ) { char x = 040; printf( % o \ n, x << 1) ; A) 100 B) 80 C) 64 D) 32 ( 38 ) A user abc. txt, A) fopen( A: \ user \ abc. txt, r ) B) fopen( A: \ \ user \ \abc. txt, r + ) C) fopen( A: \ user \abc. txt, rb ) D) fopen( A: \ \user \ \ abc. txt, w ) ( 39 ) A) char str[ 5] = good! ; B) char str[ ] = good! ; C) char * str = good! ; D) char str[ 5] = { g, o, o, d ; ( 40 ) : struct test { int ml; char m2; float m3; union uu{ char ul[ 5] ; int u2 [ 2] ; ua; myaa; sizeof( struct test) A) 12 B) 16 C) 14 D) 9

$; D) p = ( int * ) malloc( 2, sizeof( int) ) ; ( 37 ) { char x = 040; printf( % o \ n, x << 1) ; A) 100 B) 80 C) 64 D) 32 ( 38 ) A user abc. txt, A) fopen( A: \ user \ abc.$

12 ( 41 ) : int aa[ 8 ] ; aa[ 1] A) &aa[ 0] + 1 B) &aa[ 1] C) &aa[ 0] ++ D) aa + 1 ( 42 ) f( int b[ ], int m, int n) { int i, s = 0 ; for ( i = m; i < n; i = i + 2) s = s + b[ i] ; return s; { int x, a[ ] = {1, 2, 3, 4, 5, 6, 7, 8, 9 ; x = f( a, 3, 7) ; printf( % d \ n, x) ; A) 10 B) 18 C) 8 D) 15 ( 43 ) : int s[ 4 ] [ 5], ( * ps) [ 5] ; ps = s; s A) ps + 1 B) * ( ps + 3) C) ps[ 0] [ 2 ] D) * ( ps + 1) + 3 ( 44) { int b[ 3] [ 3] = {0, 1, 2, 0, 1, 2, 0, 1, 2, i, j, t = 1; for ( i = 0; i < 3; i ++ ) for( j = i; j <= i; j ++ ) t = t + b[ i] [ b[ j] [ j] ] ; printf( % d \ n, t) ; A) 3 B) 4 C) 1 D) 9 ( 45) #include < stdio. h > #include < string. h > { char b1[ 8] = abcdefg, b2[ 8], * pb = b1 + 3; while( - - pb >= b1) strcpy( b2, pb) ; printf( % d \ n, strlen( b2) ) ; A) 8 B) 3 C) 1 D) 7 ( 1) 7 ( 11 )

$1) + 3 ( 44) { int b[ 3] [ 3] = {0, 1, 2, 0, 1, 2, 0, 1, 2, i, j, t = 1; for ( i = 0; i < 3; i ++ ) for( j = i; j <= i; j ++ ) t = t + b[ i] [ b[ j] [ j] ] ; printf( % d \ n, t) ; A) 3 B) 4 C) 1 D) 9$

13 ( 46) : int * f( ) ;, f A) B) C) D) ( 47) main A) main ( int a, char * c[ ] ) B) main( int arc, char * * arv) C) main ( int argc, char * argv) D) main( int argv, char * argc[ ] ) ( 48) int x = 3; { int i; for( i = 1; i < x; i ++ ) incre( ) ; incre( ) { static int x = 1; x* = x + 1; printf( % d, x) ; A) 3 3 B) 2 2 C) 2 6 D) 2 5 ( 49) : struct link { int data; struct link * next; a, b, c, * p, * q; a b : a b data next data next 5 p 9 \0 c data next 7 q ( 1) 8 ( 11 )

$link { int data; struct link * next; a, b, c, * p, * q; a b : a b data next data next 5 p 9 \0 c data next 7 q ( 1)$

14 p a, q cc a b A) a. next = c; c. next = b; B) p. next = q; q. next = p. next; C) p - > next = &c; q - > next = p - > next; D) ( * p). next = q; ( * q). next = &b; ( 50) typedef struct { int n; char ch[ 8] ; PER; A) PER B) PER C) typedef struct D) struct ( 2, 40 ) 120, ( 1) 1 ( 2),, 2 ( 3) 3 ( 4),,,, 4 ( 5) 5 ( 6) 58, 6 { int a; scanf( % d, &a) ; if( a > 50) printf( % d, a) ; if( a > 40) printf( % d, a) ; if( a > 30) printf( % d, a) ; ( 7) 7 { int a = 177; printf( % o\ n, a) ; ( 8) 8 { int a = 0; a += ( a = 8) ; printf( % d \ n, a) ; ( 1) 9 ( 11 )

next = &b; ( 50) typedef struct { int n; char ch[ 8] ; PER; A) PER B) PER C) typedef struct D) struct ( 2, 40 ) 120, ( 1) 1 ( 2),, 2 ( 3)

15 ( 9) 9 { int a = 5, b = 4, c = 3, d; d = ( a > b > c) ; printf( % d \ n, d) ; ( 10), info ; link struct node { int info; ; 10link; ( 11) 11 { int s, i; for( s = 0, i = 1; i < 3; i ++, s += i) ; printf( % d \ n, s) ; ( 12) 12 { char * p = abcdefgh, * r; long * q; q = ( long * ) p; q ++ ; r = ( char * ) q; printf( % s \ n, r) ; ( 13) 13 { char s[ ] = abcdef ; s[ 3] = \0 ; printf( % s \ n, s) ; ( 14) 14 { int x = 0; sub( &x, 8, 1) ; printf( % d \ n, x) ; ( 1) 10 ( 11 )

$* p = abcdefgh, * r; long * q; q = ( long * ) p; q ++ ; r = ( char * ) q; printf( % s \ n, r) ; ( 13) 13 { char s[ ]$

16 sub( int * a, int n, int k) { if( k <= n) sub( a, n /2, 2* k) ; * a += k; ( 15) #define MYSWAP( z, x, y) {z = x; x = y; y = z; a b, float a = 5, b = 16, c; MYSWAP( 15, a, b) ; ( 16) #include stadio. h { FILE * fp; long num = 0L; if( ( fp = fopen( fname. dat, r ) ) == NULL) ; { printf( Open error \ n ) ; exit( 0) ; while( 16) { fgetc( fp) ; num ++ ; printf( num = % 1d \ n, num - 1) ; fclose( fp) ; ( 17), select : N M,, #define N 3 #define M 3 select( int a[ N] [ M], int * n) { int i, j, row = 1, colum = 1; for( i = 0; i < N; i ++ ) for( j = 0; j < M; j ++ ) if( a[ i] [ j] > a[ row] [ colum] ) { row = i; colum = j; * n = 17; return( 18) ; { int a[ N] [ M] = {9, 11, 23, 6, 1, 15, 9, 17, 20, max, n; max = select( a, &n) ; printf( max = % d, line = % d \ n, max, n) ; ( 18) mystrlen str, int mystrlen( char * str) { int i; for( i = 0; 19! = \0 ; i ++ ) ; return( 20) ; ( 1) 11 ( 11 )

$dat, r ) ) == NULL) ; { printf( Open error \ n ) ; exit( 0) ; while( 16) { fgetc( fp) ; num ++ ; printf( num = % 1d \ n, num - 1) ; fclose( fp) ; ( 17), select : N M,, #define N 3 #define M 3 select($

17 C,,,,,, * * *,, * * *

18 ( 2) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1) A) B) C) D) ( 2), A) B) C) D) ( 3) : A) ABCDEF B) DBEAFC C) ABDECF D) DEBFCA ( 4),, A) B) GOTO C) D) ( 5), A) B) C) D) ( 6) A) B) C) D) ( 7) A) B) C) D) ( 8) A) B) C) D) ( 9) E - R, : E - R, E - R, E - R ( ), E - R A) B) C) D) ( 10) 4, ( 2) 1 ( 11 )

19 A) B) C) D) ( 11) A) C B) C) D) ( 12) A) 5E2. 0 B) E - 3 C) 2E0 D) 1. 3E ( 13) A) long B) 2Test C) 3Dmax D) A. dat ( 14) A ASCII 65, a ASCII 97, \101 A) A B) a C) e D) ( 15) A) n = ( i = 2, ++ i) ; B) j ++ ; C) ++ ( i + 1) ; D) x = j > 0; ( 16) a b double, a = 5. 5 b = 2. 5, ( int) a + b / b A) B) 6 C) D) ( 17) i j k int, : 1, 2, 3 < >, i 1 j 2 k 3, A) scanf( % 2d% 2d% 2d, &i, &j, &k) ; B) scanf( % d % d % d, &i, &j, &k) ; C) scanf( % d, % d, % d, &i, &j, &k) ; D) scanf( i = % d, j = % d, k = % d, &i, &j, &k) ; ( 18) 3xn C 2x - 1 A) 3* x^n / ( 2* x - 1) B) 3* x* * n / ( 2* x - 1) C) 3* pow( x, n) * ( 1 /( 2* x - 1) ) D) 3* pow( n, x) / ( 2* x - 1) ( 19) : long x = L;, x A) printf( x = % d \ n, x) ; B) printf( x = % 1d \ n, x) ; C) printf( x = % 8dL \n, x) ; D) printf( x = % LD\ n, x) ; ( 20) : { int k = 2, i = 2, m; m = ( k += i* = k) ; printf( % d, % d \ n, m, i) ; A) 8, 6 B) 8, 3 C) 6, 4 D) 7, 4 ( 21) : int x = 3, y = 4, z = 5,! ( x + y) + z - 1 && y + z /2 A) 6 B) 0 C) 2 D) 1 ( 22) : y = 1 x > 0 0 x = 0, x y - 1 x < 0 A) if( x > 0) y = 1; B) y = 0; else if( x == 0) y = 0; if( x > 0) y = 1; else y =- 1; else if( x < 0) y =- 1; C) y = 0; D) if( x >= 0) if( x >= 0) if( x > 0) y = 1; ( 2) 2 ( 11 )

20 if( x > 0) y = 1; else y = 0; else y =- 1; else y =- 1; ( 23), k = n ++ A) k = n, n = n + 1 B) n = n + 1, k = n C) k = ++ n D) k + = n + 1 ( 24) : 10 4,, : { int n, k; float score, sum, ave; sum = 0. 0; for( n = 1; n <= 10; n ++ ) { for( k = 1; k <= 4; k ++ ) { scanf( % f, &score) ; sum += score; ave = sum/ 4. 0; printf( NO% d: % f\ n, n, ave) ;, A) sum = 0. 0; B) sum += score; C) ave = sum /4. 0; D) printf( NO% d: % f\ n, n, ave) ; ( 25) : int n = 0, p; do{ scanf( % d, &p) ; n ++ ; while( p! = && n < 3) ; do - while A) p n 3 B) p n 3 C) p n 3 D) p n 3 ( 26) { int a = 15, b = 21, m = 0; switch( a% 3) { case 0: m ++ ; break; case 1: m ++ ; switch( b% 2) { default: m ++ ; case 0: m ++ ; break; printf( % d \ n, m) ; A) 1 B) 2 C) 3 D) 4 ( 27) C,, A) void B) int C) float D) double ( 28) : int n = 2, * p = &n, * q = p;, ( 2) 3 ( 11 )

$0; D) printf( NO% d: % f\ n, n, ave) ; ( 25) : int n = 0, p; do{ scanf( % d, &p) ; n ++ ; while( p!$

21 A) p = q; B) * p = * q; C) n = * q; D) p = n; ( 29) float fun( int x, int y) {return( x + y) ; { int a = 2, b = 5, c = 8; printf( % 3. 0f\ n, fun( ( int) fun( a + c, b), a - c) ) ; A) B) 9 C) 21 D) 9. 0 ( 30) void fun( char * c, int d) { * c = * c + 1; d = d + 1; printf( % c, % c, * c, d) ; { char a = A, b = a ; fun( &b, a) ; printf( % c, % c \ n, a, b) ; A) B, a, B, a B) a, B, a, B C) A, b, A, b D) b, B, A, b ( 31) sort a void sort( int a[ ], int n) { int i, j, t; for( i = 0; i < n - 1; i ++ ) for( j = i + 1; j < n; j ++ ) if( a[ i] < a[ j] ) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; { int aa[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, i; sort( &aa[ 3], 5) ; for( i = 0; i < 10; i ++ ) printf( % d, aa[ i] ) ; printf( \n ) ; A) 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 B) 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 C) 1, 2, 3, 8, 7, 6, 5, 4, 9, 10 D) 1, 2, 10, 9, 8, 7, 6, 5, 4, 3 ( 32) int f( int n) { if( n == 1) return 1; else return f( n - 1) + 1; ( 2) 4 ( 11 )

22 { int i, j = 0; for( i = 1; i < 3; i ++ ) j += f( i) ; printf( % d \ n, j) ; A) 4 B) 3 C) 2 D) 1 ( 33) { char a[ ] = { a, b, c, d, e, f, g, h, \0 ; int i, j; i = sizeof( a) ; j = strlen( a) ; printf( % d, % d \ n, i, j) ; A) 9, 9 B) 8, 9 C) 1, 8 D) 9, 8 ( 34) reverse a void reverse( int a[ ], int n) { int i, t; for( i = 0; i < n /2; i ++ ) { t = a[ i] ; a[ i] = a[ n i] ; a[ n i] = t; { int b[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10; int i, s = 0; reverse( b, 8) ; for( i = 6; i < 10; i ++ ) s += b[ i] ; printf( % d \ n, s) ; A) 22 B) 10 C) 34 D) 30 ( 35) { int aa[ 4] [ 4] = { {1, 2, 3, 4, {5, 6, 7, 8, {3, 9, 10, 2, {4, 2, 9, 6 ; int i, s = 0; for( i = 0; i < 4; i ++ ) s += aa[ i] [ 1] ; printf( % d \ n, s) ; A) 11 B) 19 C) 13 D) 20 ( 36) #include < string. h > { char * p = abcde \0fghjik \0 ; printf( % d \ n, strlen( p) ) ; ( 2) 5 ( 11 )

23 A) 12 B) 15 C) 6 D) 5 ( 37) type1. h : #define N 5 #define M1 N* 3 : #include type1. h #define M2 N* 2 { int i; i = M1 + M2; printf( % d \ n, i) ; : A) 10 B) 20 C) 25 D) 30 ( 38) #include < stdio. h > { FILE * fp; int i = 20, j = 30, k, n; fp = fopen( d1. dat, w ) ; fprintf( fp, % d \ n, i) ; fprintf( fp, % d \ n, j) ; fclose( fp) ; fp = fopen( d1. dat, r ) ; fscanf( fp, % d% d, &k, &n) ; printf( % d% d \ n, k, n) ; fclose( fp) ; A) B) C) D) ( 39) A), B), fclose C) fread, D) FILE ( 40) #include < string. h > main( int argc, char * argv[ ] ) { int i, len = 0; for( i = 1; i < argc; i ++ ) len += strlen( argv[ i] ) ; printf( % d \ n, len) ; exl. exe, : ex1 abcd efg 10 < > A) 22 B) 17 C) 12 D) 9 ( 2) 6 ( 11 )

24 ( 41) int fa( int x) { return x* x; int fb( int x) { return x* x* x; int f( int ( * f1) ( ), int ( * f2) ( ), int x) { return f2( x) - f1( x) ; { int i; i = f( fa, fb, 2) ; printf( % d \ n, i) ; A) - 4 B) 1 C) 4 D) 8 ( 42) int a = 3; { int s = 0; { int a = 5; s += a ++ ; s += a ++ ; printf( % d \ n, s) ; A) 8 B) 10 C) 7 D) 11 ( 43) void ss( char * s, char t) { while ( * s) { if( * s == t) * s = t - a + A ; s ++ ; { char str1[ 100] = abcddfefdbd, c = d ; ss( str1, c) ; printf( % s \ n, str1) ; A) ABCDDEFEDBD B) abcddfefdbd C) abcaafefaba D) Abcddfefdbd ( 44) struct STU { char num[ 10] ; float score[ 3] ; ; { struct STU s[ 3] = {{ 20021, 90, 95, 85, int i; float sum = 0; { 20022, 95, 80, 75, { 20023, 100, 95, 90, * p = s; ( 2) 7 ( 11 )

25 for( i = 0; i < 3; i ++ ) sum = sum + p - > score[ i] ; printf( % 6. 2f\ n, sum) ; A) B) C) D) ( 45) : struct sk { int a; float b; data; int * p; p data a, A) p = &a; B) p = data. a; C) p = &data. a; D) * p = data. a; ( 46) #include < stdlib. h > struct NODE { int num; struct NODE * next; ; { struct NODE * p, * q, * r; p = ( struct NODE* ) malloc( sizeof( struct NODE) ) ; q = ( struct NODE* ) malloc( sizeof( struct NODE) ) ; r = ( struct NODE* ) malloc( sizeof( struct NODE) ) ; p - > num = 10; q - > num = 20; r - > num = 30; p - > next = q; q - > next = r; printf( % d \ n, p - > num + q - > next - > num) ; A) 10 B) 20 C) 30 D) 40 ( 47) typedef int * INTEGER; INTEGER p, * q; A) p int B) p int C) q int D) INTEGER int ( 48) { unsigned char, a, b, c; a = 0x3; b = a 0x8; c = b < < 1; printf( % d % d \ n, b, c) ; A) B) C) D) ( 2) 8 ( 11 )

26 ( 49) #include < stdlib. h > { char * p, * q; p = ( char * ) malloc( sizeof( char) * 20) ; q = p; scanf( % s% s, p, q) ; printf( % s % s \n, p, q) ; : abc def < >, A) def def B) abc def C) abc d D) d d ( 50) f n #include < string. h > void f( char p[ ] [ 10], int n) { char t[ 20] ; int i, j; for( i = 0; i < n - 1; i ++ ) for( j = i + 1; j < n; j ++ ) if( strcmp( p[ i], p[ j] ) < 0) {strcpy( t, p[ i] ) ; strcpy( p[ i], p[ j] ) ; strcpy( p[ j], t) ; { char p[ ] [ 10] = { abc, aabdfg, abbd, dcdbe, cd ; int i; f( p, 5) ; printf( % d \ n, strlen( p[ 0] ) ) ; A) 6 B) 4 C) 5 D) 3 ( 2, 40 ) 120, ( 1), 1 ( 2) 6 2 ( 3) 3 ( 4) -, 4- ( 5),,,, 5 ( 6) : int n, * k = &n; k n, scanf( % d, 6) ; printf( % d \ n, 7) ; ( 7) 8 { int x = 10, y = 20, t = 0; if( x == y) t = x; x = y; y = t; printf( % d, % d \n, x, y) ; ( 8) 9 ( 2) 9 ( 11 )

27 { int x = 15; while( x > 10&& x < 50) { x ++ ; if( x /3) { x ++ ; break; else continue; printf( % d \ n, x) ; ( 9) : #include < stdio. h > { char c; while( ( c = getchar( ) )! =? ) putchar( - - c) ;, : Y? N? ( 10) 11 void fun( int x, int y) { x = x + y; y = x - y; x = x - y; printf( % d, % d, x, y) ; { int x = 2, y = 3; fun( x, y) ; printf( % d, % d \ n, x, y) ; < >, 10 ( 11) S = ! + 1 3! n!, double fun( int n) { double s = 0. 0, fac = 1. 0; int i; for ( i = 1; i <= n; i ++ ) return s; { fac = fac 12; s = s + fac; ( 12) fun : a N N,, N #include < stdio. h > #define N 100 int fun( int( * a) [ N] ) { int row, col, max, min; for( row = 0; row < N; row ++ ) { for( max = a[ row] [ 0], col = 1; col < N; col ++ ) if( 13) max = a[ row] [ col] ; ( 2) 10 ( 11 )

28 return min; if( row == 0) min = max; else if( 14) min = max; ( 13) sstrcmp( ) s t, 0; s t, 0; s t, 0 ( strcmp( ) ) #include < stdio. h > int sstrcmp( char * s, char * t) { while( * s&&* t&& * s == 15) { s ++ ; t ++ ; return 16; ( 14) : 17 #define N 10 #define s( x) x* x #define f( x) ( x* x) { int i1, i2; i1 = 1000 / s( N) ; i2 = 1000 / f( N) ; printf( % d % d \ n, i1, i2) ; ( 15) : 18 void swap( int * a, int * b) { int * t; t = a; a = b; b = t; { int x = 3, y = 5, * p = &x, * q = &y; swap( p, q) ; printf( % d% d \ n, * p, * q) ; ( 16) : 19 typedef union student { char name[ 10] ; long sno; char sex; float score[ 4] ; STU; { STU a[ 5] ; printf( % d \ n, sizeof( a) ) ; ( 17) fp, d1. dat,, : fp = fopen ( 20) ; ( 2) 11 ( 11 )

29 C,,,,,, * * *,, * * *

30 ( 3) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1), A) B) C) D) ( 2) A) B) C) D) ( 3) 5, A) 32 B) 31 C) 16 D) 15 ( 4) A) B) C) D) ( 5)? A) B) C) D) ( 6) A) B) C) D) ( 7), A) B) C) D) ( 8), A) B) C) D) ( 9) ( ) A) B) C) D) ( 10), A) B) C) D) ( 11) A) C B) C C) C D) C, ( 12) C A) B) if switch break C) for while do - while D) if for continue ( 3) 1 ( 11 )

31 ( 13) C A) main B) main C) main D) main ( 14) A) C B) C C) C D) C ( 15) C A) ( ) B), C), D), ( 16) ( n ) int m = 32767, n = ; printf( % d, % o\ n, m, n) ; A) 32767, B) 32767, C) 32767, D) 32767, ( 17) A) B) char int, float C) int, double float D) char int float ( 18) int m = 0xabc, n = 0xabc; m - = n; printf( % X\ n, m) ; A) 0X0 B) 0x0 C) 0 D) 0XABC ( 19) int m = 0, n = 0; char c = a ; scanf( % d% c% d, &m, &c, &n) ; printf( % d, % c, % d \ n, m, c, n) ; : 10A10 < >, A) 10, A, 10 B) 10, a, 10 C) 10, a, 0 D) 10, A, 0 ( 20) { int i; for ( i = 0; i < 3; i ++ ) switch ( i) { case 1: printf( % d, i) ; case 2: default: printf( % d, i) ; printf( % d, i) ; A) B) 012 C) D) 120 ( 21) ( 3) 2 ( 11 )

32 { int i = 1, j = 1, k = 2; if ( ( j ++ k ++ ) &&i ++ ) printf( % d, % d, % d \ n, i, j, k) ; A) 1, 1, 2 B) 2, 2, 1 C) 2, 2, 2 D) 2, 2, 3 ( 22) { int a = 5, b = 4, c = 3, d = 2; if( a > b > c) printf( % d \ n, d) ; else if( ( c - 1 >= d) = = 1) else printf( % d \ n, d + 1) ; printf( % d \ n, d + 2) ; A) 2 B) 3 C) 4 D), ( 23) { int p[ 7] = {11, 13, 14, 15, 16, 17, 18, i = 0, k = 0; while( i < 7&&p[ i] % 2) { k = k + p[ i] ; i ++ ; printf( % d \ n, k) ; A) 58 B) 56 C) 45 D) 24 ( 24) { int i = 0, s = 0; do { if( i% 2) { i ++ ; continue; i ++ ; s += i; while( i < 7) ; printf( % d \ n, s) ; A) 16 B) 12 C) 28 D) 21 ( 25) { int i = 10, j = 1; printf( % d, % d \ n, i - -, ++ j) ; A) 9, 2 B) 10, 2 C) 9, 1 D) 10, 1 ( 3) 3 ( 11 )

33 ( 26) { char a, b, c, * d; a = \ ; b = \ xbc ; c = \ 0xab ; d = \0127 ; printf( % c % c % c% c \ n, a, b, c, * d) ;, A) a = \ ; B) b = \ xbc ; C) d = \0127 ; D) a = \ ; c = \0xab ; ( 27) int fl( int x, int y) { return x > y? x: y; int f2( int x, int y) { return x > y? y: x; { int a = 4, b = 3, c = 5, d, e, f; d = f1( a, b) ; d = f1( d, c) ; e = f2( a, b) ; e = f2( e, c) ; f = a + b + c - d - e; printf( % d, % d, % d \ n, d, f, e) ; A) 3, 4, 5 B) 5, 3, 4 C) 5, 4, 3 D) 3, 5, 4 ( 28) void f( int x, int y) { int t; if( x < y) { t = x; x = y; y = t; { int a = 4, b = 3, c = 5; f( a, b) ; f( a, c) ; f( b, c) ; printf( % d, % d, % d \ n, a, b, c) ; A) 3, 4, 5 B) 5, 3, 4 C) 5, 4, 3 D) 4, 3, 5 ( 29) #include < stdio. h > int a = 4, b = 3, * p, * q, * w; p = &a; q = &b; w = q; q = NULL; A) * q = 0; B) w = p; C) * p = a; D) * p = * w; ( 30) int * f( int * x, int * y) { if( * x < * y) return x; ( 3) 4 ( 11 )

34 else return y; { int a = 7, b = 8, * p, * q, * r; p = &a; q = &b; r = f( p, q) ; printf( % d, % d, % d \ n, * p, * q, * r) ; A) 7, 8, 8 B) 7, 8, 7 C) 8, 7, 7 D) 8, 7, 8 ( 31) { char * s[ ] = { one, two, three, * p; p = s[ 1] ; printf( % c, % s \ n, * ( p + 1), s[ 0] ) ; A) n, two B) t, one C) w, one D) o, two ( 32) { int x[ 8] = {8, 7, 6, 5, 0, 0, * s; s = x + 3; printf( % d \ n, s[ 2] ) ; A) B) 0 C) 5 D) 6 ( 33) A) int N = 5, b[ N] [ N] ; B) int a[ 1] [ 2] = {{1, {3 ; C) int c[ 2] [ ] = {{1, 2, 3, 4 ; D) int d[ 3] [ 2] = { {1, 2, {34 ; ( 34) { int m[ ] [ 3] = {1, 4, 7, 2, 5, 8, 3, 6, 9; int i, j, k = 2; for( i = 0; i < 3; i ++ ) { printf( % d, m[ k] [ i] ) ; A) B) C) D) ( 35) :, #define N 10 void arrin( int x[ N] ) { int i = 0; while( i < N) scanf( % d, ) ; ( 3) 5 ( 11 )

35 A) x + i B) &x[ i + 1] C) x + ( i ++ ) D) &x[ ++ i] ( 36) { char s[ ] = \ n123 \ \ ; printf( % d, % d \ n, strlen( s), sizeof( s) ) ; A) B) 6, 7 C) 5, 6 D) 6, 6 ( 37) fun( char * s1, char * s2) { int i = 0; while ( s1[ i] == s2[ i] && s2[ i]! = \0 ) i ++ ; return ( s1[ i] == \0 && s2[ i] == \0 ) ; A) s2 s1 B) s1 s2, s1 s2, 1, 0 C) s1 s2,, 1, 0 D) s1 s2, s1 s2, 1, 0 ( 38) A) B) ( static) C) D) auto static ( 39) typedef struct { int n; char c; double x; STD;, A) STD tt[ 2] = {{1, A, 62, {2, B, 75 ; B) STD tt[ 2] = {1, A, 62, 2, B, 75 ; C) struct tt[ 2] = {{1, A, {2, B ; D) struct tt[ 2] = {{1, A, 62. 5, {2, B, ; ( 40) { union { unsigned int n; unsigned char c; ul; u1. c = A ; printf( % c \ n, u1. n) ; A) B) C) A D) 65 ( 41) { char str[ ] = xyz, * ps = str; while( * ps) ps ++ ; for( ps - - ; ps - str >= 0; ps - - ) puts( ps) ; ( 3) 6 ( 11 )

36 A) yz B) z C) z D) x xyz yz yz xy ( 42) { int a[ ] [ 3] = { {1, 2, 3, {4, 5, 0, ( * pa) [ 3], i; pa = a; for ( i = 0; i < 3; i ++ ) if( i < 2) pa[ 1] [ i] = pa[ 1] [ i] - 1; else pa[ 1] [ i] = 1; printf( % d \ n, a[ 0] [ 1] + a[ 1] [ 1] + a[ 1] [ 2] ) ; xyz xyz A) 7 B) 6 C) 8 D) ( 43) void fun( int * a, int i, int j) { int t; if( i < j) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; fun( a, ++ i, - - j) ; { int a[ ] = {1, 2, 3, 4, 5, 6, i; fun( a, 0, 5) ; for ( i = 0; i < 6; i ++ ) printf( % d, a[ i] ) ; A) B) C) D) ( 44) main( int argc, char * argv[ ] ) { int n, i = 0; while( argv[ 1] [ i]! = \0 ) { n = fun( ) ; i ++ ; printf( % d \ n, n* argc) ; int fun( ) { static int s = 0; s += 1; return s; exam. exe, exam 123 < > ( 3) 7 ( 11 )

37 A) 6 B) 8 C) 3 D) 4 ( 45), fun, main p A) B) { int * p; { int * p; fun( p) ; fun( &p) ; int fun( int * p) int fun( int * * p) { int s; p = &s; { int s; * p = &s; C) #include < stdlib. h > D) #include < stdlib. h > { int * p; { int * p; fun( &p) ; fun( p) ; int fun( int * * p) int fun( int * p) { * p = ( int* ) malloc( 2) ; { p = ( int* ) malloc( sizeof( int) ) ; ( 46) STP, STP s; char * s; A) typedef STP char * s B) typedef * char STP; C) typedef STP * char; D) typedef char * STP; ( 47) struct ss { char name[ 10] ; int age; char sex; std[ 3], * p = std; A) scanf( % d, &( * p). age) ; B) scanf( % s, &std. name) ; C) scanf( % c, &std[ 0]. sex) ; D) scanf( % c, &( p - > sex) ) ; ( 48) char x , ( 2 + x) ^( 3) A) B) C) D) ( 49) A) C ASCII B) C C) C, D) C, ( 50) abc. txt, #, #include < stdio. h > { FILE * fout; char ch; fout = fopen( abc. txt, w ) ; ch = fgetc( stdin) ; while( ch! = # ) { fputc( ch, fout) ; ( 3) 8 ( 11 )

38 ch = fgetc( stdin) ; fclose( fout) ; A) fopen B) C) fgetc D) stdin ( 2, 40 ) 120, ( 1) 1 ( 2) 2 ( 3),, 3 ( 4) 4 : 4 ( 5),, 5 ( 6) int i =- 19, j = i% 4; printf( % d \ n, j) ; 6 ( 7) { int i, j; scanf( i = % d, j = % d, &i, &j) ; printf( i = % d, j = % d \ n, i, j) ; i 10, j 20, 7 ( 8) { int p, a = 5; if( p = a! = 0) else printf( % d \ n, p) ; printf( % d \n, p + 2) ; 8 ( 9) { int a = 4, b = 3, c = 5, t = 0; if( a < b) t = a; a = b; b = t; if( a < c) t = a; a = c; c = t; printf( % d% d% d \ n, a, b, c) ; 9 ( 10) ( 3) 9 ( 11 )

39 { int a[ 4] [ 4] = { {1, 2, - 3, - 4, {0, - 12, - 13, 14, { - 21, 23, 0, - 24, { - 31, 32, - 33, 0 ; int i, j, s = 0; for( i = 0; i < 4; i ++ ) { for( j = 0; j < 4; j ++ ) { if( a[ i] [ j] < 0) continue; if ( a[ i] [ j] == 0) break; s += a[ i] [ j] ; printf( % d \ n, s) ; 10 ( 11) { char a; a = H - A + 0 ; printf( % c \ n, a) ; 11 ( 12) int f( int x, int y) { return( y - x) * x; { int a = 3, b = 4, c = 5, d; d = f( f( 3, 4), f( 3, 5) ) ; printf( % d \ n, d) ; 12 ( 13) YangHui, : ( 1) 0 1 ( 2) ( 3) 1 #define N 6 void YangHui( int x[ N] [ N] ) { int i, j; x[ 0] [ 0] = 1; for( i = 1; i < N; i ++ ) { x[ i] [ 0] = 13= 1; ( 3) 10 ( 11 )

40 for ( j = 1; j < i; j ++ ) x[ i] [ j] = 14; ( 14) s void dele( char * s) { int n = 0, i; for( i = 0; s[ i] ; i ++ ) if( 15) s[ n ++ ] = s[ i] ; s[ n] = 16; ( 15) findbig 3 findbig { int findbig( int, int, int) ; int ( * f) ( ), x, y, z, big; f = 17; scanf( % d% d% d, &x, &y, &z) ; big = ( * f) ( x, y, z) ; printf( big = % d \n, big) ; ( 16) 18 #define MCRA( m) #define MCRB( n, m) { int i = 2, j = 3; 2* m 2* MCRA( n) + m printf( % d \ n, MCRB( j, MCRA( i) ) ) ; ( 17) struct ss { int info; struct ss * link; x, y, z; : y 19 x y z ( 18) test. txt, : Hello, everyone!, test. txt, fr, 20 #include < stdio. h > { FILE * fr; char str[ 40] ; fgets( str, 5, fr) ; printf( % s \n, str) ; fclose( fr) ; ( 3) 11 ( 11 )

41 C,,,,,, * * *,, * * *

42 ( 4) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1),,, A) B) C) D) ( 2), A) B) C) D) ( 3) : A) ABCDEF B) BDAECF C) ABDCEF D) DBEFCA ( 4), A) B) C) D) ( 5), A) B) C) D) ( 6) A) B) C) D) ( 7),? A) B) C) D) ( 8), A) B) C) D) ( 9), A) B) C) D) ( 4) 1 ( 11 )

43 ( 10), A) B) C) D) ( 11) A) C B) { C) C, D) C, ( 12) C A) 10110B B) 0386 C) 0Xffa D) x2a2 ( 13) A) scanf B) Void C) 3com D) int ( 14) {int a; char c = 10; float f = ; double x; a = f/ = c* ( x = 6. 5) ; printf( % d % d % 3. 1f % 3. 1f \ n, a, c, f, x) ; A) B) C) D) ( 15) A) 0 <= x < 100 B) i = j == 0 C) ( char) ( ) D) x + 1 = x + 1 ( 16) {int a = 1, b = 2, m = 0, n = 0, k; k = ( n = b > a) ( m = a < b) ; printf( % d, % d \n, k, m) ; A) 0, 0 B) 0, 1 C) 1, 0 D) 1, 1 ( 17) : int x, y; scanf( % d, % d, &x, &y) ; x 11, y 12,, A) < > B) 11, 12 < > C) 11, 12 < > D) 11, < > ( 18) : int x = 2002, y = 2003; printf( % d \ n, ( x, y) ; 12 < > A), B) C) 2002 D) 2003 ( 19) x float, x, ( 4) 2 ( 11 )

44 A) x = x* / ; B) x = ( x* ) /100. 0; C) x = ( int) ( x* ) / D) x = ( x / ) * ; ( 20) : int a = 1, b = 2, c = 3, x;,, x 3 A) if ( c < a) x = 1; B) if ( a < 3) x = 3; else if ( b < a) x = 1; else if ( a < 2) x = 2; else x = 3; else x = 1; C) if ( a < 3) x = 3; D) if( a < b) x = b; if ( a < 2) x = 2; if ( b < c) x = c; if ( a < 1) x = 1; if ( c < a) x = a; ( 21) { int s = 0, a = 1, n; scanf( % d, &n) ; do { s += 1; a = a - 2; while( a! = n) ; printf( % d \ n, s) ; 2, n A) - 1 B) - 3 C) - 5 D) 0 ( 22), s a b c, a c ( c 0) s = a; for( b = 1; b <= c; b ++ ) s = s + 1; A) s = a + b; B) s = a + c; C) s = s + c; D) s = b + c; ( 23) { int k = 4, n = 0; for( ; n < k; ) { n ++ ; if( n% 3! = 0) continue; K - - ; printf( % d, % d \ n, k, n) ; A) 1, 1 B) 2, 2 C) 3, 3 D) 4, 4 ( 24) : s = { int n; float s; s = 1. 0; for( n = 10; n > 1; n - - ) ( 4) 3 ( 11 )

45 s = s + 1 /n; printf( % 6. 4f\ n, s) ;, A) s = 1. 0; B) for( n = 10; n > 1; n - - ) C) s = s + 1 / n; D) printf( % 6. 4f\ n, s) ; ( 25) ch, A) ch = \ ; B) ch = ; C) ch = NULL; D) ch = \ xaa ; ( 26), A) B) C) D) ( 27) : void fun( int n, double x) {, fun A) fun( int y, double m) ; B) k = fun( 10, 12. 5) ; C) fun( x, n) ; D) void fun( n, x) ; ( 28) void fun ( char * a, char * b) { a = b; ( * a) ++ ; { char cl = A, c2 = a, * p1, * p2; p1 = &c1; p2 = &c2; fun( p1, p2) ; printf( % c% c \ n, c1, c2) ; A) Ab B) aa C) Aa D) Bb ( 29) stdio. h,, A) int * i = NULL; B) float * f = NULL; scanf( % d, i) ; * f = 10. 5; C) char t = m, * c = &t; D) long * L; * c = &t; L = \ 0 ; ( 30) #include < stdio. h > {printf( % d \ n, NULL) ; A) 0 B) 1 C) - 1 D) NULL, ( 31) c, A) c = 97 ; B) c = 97 ; C) c = 97; D) c = a ; ( 32) A) int a[ 2] [ 2] = {{1, {2 ; B) int a[ ] [ 2] = {1, 2, 3, 4 ; C) int a[ 2] [ 2] = { {1, {2, 3 ; D) int a[ 2] [ ] = {1, 2, {3, 4 ; ( 4) 4 ( 11 )

46 ( 33) c1 A) typedef struct B) struct color cl { int red; { int red; int green; ; int green; int blue; int blue; COLOR; ; COLOR cl; C) struct color D) struct { int red; { int red; int green; int green; int blue; int blue; cl; cl; ( 34) A) int num[ ] ; B) #define N 100 int num[ N] ; C) int num[ ] ; D) int N = 100; ( 35) int num[ N] ; A) char s[ 8] ; s = { Beijing ; B) char * s; s = { Beijing ; C) char s[ 8] ; s = Beijing ; D) char * s; s = Beijing ; ( 36) fun( int * p) { return * p; A) B) p C) p D) p ( 37), A) max( int x, int y, int * z) B) int max( int x, y) {* z = x > y? x y; { int z; z = x > y? x y; return z; C) max( int x, int y) D) int max( int x, int y) { int z; { return( x > y? x y) ; ( 38) z = x > y? x y; return( z) ; #include < stdio. h > #define F( X, Y) ( X) * ( Y) { int a = 3, b = 4; printf( % d \ n, F( a ++, b ++ ) ) ; ( 4) 5 ( 11 )

47 A) 12 B) 15 C) 16 D) 20 ( 39) fun( int a, int b) { if( a > b) return( a) ; else return( b) ; { int x = 3, y = 8, z = 6, r; r = fun( fun( x, y), 2* z) ; printf( % d \ n, r) ; A) 3 B) 6 C) 8 D) 12 ( 40) : int * p[ 3] ;, A) int p, B) p,, int C) * p, int D) p, int ( 41) scmp s1 s2 #include < stdio. h > #include < string. h > char * scmp( char * s1, char * s2) { if( strcmp( s1, s2) < 0) return( s1) ; else return( s2) ; { int i; char string[ 20], str[ 3] [ 20] ; for( i = 0; i < 3; i ++ ) gets( str[ i] ) ; strcpy( string, scmp( str[ 0], str[ 1] ) ) ; / * strcpy * / strcpy( string, scmp( string, str[ 2] ) ) ; printf( % s \ n, string) ; : abcd abba abc, A) abcd B) abba C) abc D) abca ( 42) struct s { int x, y; data[ 2] = {10, 100, 20, 200 ; { struct s * p = data; printf( % d \ n, ++ ( p - > x) ) ; ( 4) 6 ( 11 )

48 A) 10 B) 11 C) 20 D) 21 ( 43) { int a = 5, * b, * * c; c = &b; b = &a; c = &b; b = &a;, ** c A) a B) b C) a D) b ( 44) #include < string. h > {char str[ ] [ 20] = { Hello, Beijing, * p = str; printf( % d \ n, strlen( p + 20) ) ; A) 0 B) 5 C) 7 D) 20 ( 45) fun( char * p2, char * p1) { while( ( * p2 = * p1)! = 0 ) { p1 ++ ; p2 ++ ; A) p1 p2 B) p1 p2 C) p1 p2 D) p1 p2 \0 ( 46) { int x = 3, y = 2, z = 1; printf( % d \ n, x/ y& z) ; A) 3 B) 2 C) 1 D) 0 ( 47) fp, feof( fp) A) 0 B) 1 C) - 1 D) 0 ( 48) C A) ASCII, C B), C C), D), ( 49) { int a[ 3] [ 3], * p, i; p = &a[ 0] [ 0] ; ( 4) 7 ( 11 )

49 for ( i = 0; i < 9; i ++ ) p[ i] = i + 1; printf( % d \ n, a[ 1] [ 2] ) ; A) 3 B) 6 C) 9 D) 2 ( 50),, p q r struct node { int data; truct node * next; * p, * q, * r; q r,, A) r - > next = q; q - > next = r - > next; p - > next = r; B) q - > next = r - > next; p - next = r; r - > next = q; C) p - > next = r; q - > next = r - > next; r - > next = q; D) q - > next = r - > next; r - > next = q; p - > next = r; ( 2, 40 ) 120, ( 1) 1 ( 2), 2 ( 3) 3 ( 4), 4 ( 5), 5 ( 6) 6 { int p = 30; printf( % d \ n, ( p /3 > 0? p /10: p% 3) ) ; ( 7) 7 {char m; m = B + 32; printf( % C\ n, m) ; ( 8) 8 { int a = 1, b = 3, c = 5; ( 4) 8 ( 11 )

50 if ( c = a + b) printf( yes \ n ) ; else printf( no\ n ) ; ( 9) 9 { int i, m = 0, n = 0, k = 0; for( i = 9; i <= 11; i ++ ) switch( i /10) { case 0: m ++ ; n ++ ; break; case 10: n ++ ; break; default: k ++ ; n ++ ; printf( % d % d % d \ n, m, n, k) ; ( 10), # 10 #include < stdio. h > { int i, j; for( i = 1; i < 5; i ++ ) for( j = 2; j <= i; j ++ ) putchar( # ) ; ( 11) fun : m = , int fun( int n) { int m = 0, f = 1, i; for( i = 1; i <= n; i ++ ) m += i* f; f = 11; return m; {printf( m = % d \ n, 12) ; ( 12) 13 { int i, n[ ] = {0, 0, 0, 0, 0; for( i = 1; i <= 4; i ++ ) { n[ i] = n[ i - 1] * 2 + 1; printf( % d, n[ i] ) ; ( 4) 9 ( 11 )

51 ( 13) 14 { int i, j, a[ ] [ 3] = {1, 2, 3, 4, 5, 6, 7, 8, 9 ; for( i = 0; i < 3; i ++ ) for( j = i + 1; j < 3; j ++ ) a[ j] [ i] = 0; for( i = 0; i < 3; i ++ ) { for( j = 0; j < 3; j ++ ) printf( % d, a[ i] [ j] ) ; printf( \n ) ; ( 14) 15 int a = 5; fun( int b) { static int a = 10; a += b ++ ; printf( % d, a) ; { int c = 20; fun( c) ; a += c ++ ; printf( % d \ n, a) ; ( 15), 16( double, double) ; { double x, y; scanf( % 1f% 1f, &x, &y) ; printf( % 1f \n, max( x, y) ) ; double max( double a, double b) {return( a > b? ab) ; ( 16) : 3, abcde < >, 17 #include < string. h > move( char * str, int n) { char temp; int i; temp = str[ n - 1] ; ( 4) 10 ( 11 )

52 for( i = n - 1; i > 0; i - - ) str[ i] = str[ i - 1] ; str[ 0] = temp; { char s[ 50] ; int n, i, z; scanf( % d, % s, &n, s) ; z = strlen( s) ; for( i = 1; i <= n; i ++ ) move( s, z) ; printf( % s \n, s) ; ( 17) 18 fun( int x) { if( x/2 > 0) fun( x/ 2) ; printf( % d, x) ; { fun( 6) ; ( 18) : struct node {int data; struct node * next; * p; malloc, p struct node p = ( struct node * ) malloc 19; ( 19) s d, d, : abc123edf456gh, : #include < stdio. h > #include < ctype. h > { char s[ 80], d[ 80] ; int i, j; gets( s) ; for( i = j = 0; s[ i]! = \0 ; i ++ ) if( 20) {d[ j] = s[ i] ; j ++ ; d[ j] = \0 ; puts( d) ; ( 4) 11 ( 11 )

53 C,,,,,, * * *,, * * *

54 ( 5) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1), A) B) C) D) ( 2), A) B) C) D) ( 3) : A) ABCDEF B) BDAECF C) ABDCEF D) DBEFCA ( 4), A) ( ) B) C) D) goto ( 5),,, A) B) C) D) ( 6) A) B) C) D) ( 7) 4 : A) B) C) D) ( 8), A) B) C) D) ( 9) ( ) A) B) C) D) ( 10), ( 5) 1 ( 11 )

55 A) B) C) D) ( 11) 5, 4 A) B) C) D) ( 12) A) C B) C C) C D) C ( 13) C A) 1. 2E0. 5 B) E C) 5E - 3 D) E15 ( 14) 4, A) main B) If C) txt D) int enclude max REAL k 2 sin turbo 3COM 001 ( 15), A) x1 = 26. 8% 3; B) = x2; C) x3 = 0x12; D) x4 = = 3; ( 16) int a = 0; double b = 1. 25; char c = A ; #define d 2 A) a ++ ; B) b ++ ; C) c ++ ; D) d ++ ; ( 17) : float a = 2, b = 4, h = 3; C 1 2 ( a + b) h A) ( a + b) * h /2 B) ( 1 /2) * ( a + b) * h C) ( a + b) * h* 1 /2 D) h /2* ( a + b) ( 18) { int x = 102, y = 012; printf( % 2d, % 2d \ n, x, y) ; A) 10, 01 B) 02, 12 C) 102, 10 D) 02, 10 ( 19) 4, A) { ; B) a = 0, b = 0, c = 0; C) if( a > 0) ; D) if( b = = 0) m = 1; n = 2; ( 20) : int a, * pa = &a; scanf a A) scanf( % d, pa) ; B) scanf( % d, a) ; C) scanf( % d, &pa) ; D) scanf( % d, * pa) ; ( 21) k = a > b? ( b > c? 1: 0) : 0; A) if( ( a > b) &&( b > c) ) k = 1; B) if( ( a > b) ( b > c) ) k = 1; else k = 0; else k = 0; C) if( a <= b) k = 0; D) if( a > b) k = 1; else if( b <= c) k = 1; else if( b < c) k = 1; ( 22) { char k; int i; for( i = 1; i < 3; i ++ ) { scanf( % c, &k) ; switch( k) else k = 0; ( 5) 2 ( 11 )

56 { case 0 : printf( another \ n ) ; case 1 : printf( number \n ) ;, : 01 < >, A) another B) another C) another D) number number number number number another number ( 23) { int x = 0, y = 5, z = 3; while( z - - > 0 && ++ x < 5) y = y - 1; printf( % d, % d, % d \ n, x, y, z) ; A) 3, 2, 0 B) 3, 2, - 1 C) 4, 3, - 1 D) 5, - 2, - 5 ( 24) { int i, s = 0; for( i = 1; i < 10; i += 2) s += i + 1, printf( % d \ n, s) ; A) 1 9 B) 1 10 C) 1 9 D) 1 10 ( 25) { int i, n = 0; for( i = 2; i < 5; i ++ ) { do { if( i% 3) continue; n ++ ; while(! i) ; n ++ ; printf( n = % d \ n, n) ; A) n = 5 B) n = 2 C) n = 3 D) n = 4 ( 26) double myadd( double a, double b) { return( a + b) ;,, A) double myadd( double a, b) ; B) double myadd( double, double) ; C) double myadd( double b, double a) ; D) double myadd( double x, double y) ; ( 27) char fun( char x, char y) { if( x < y) return x; return y; ( 5) 3 ( 11 )

57 { int a = 9, b = 8, c = 7 ; printf( % c \ n, fun( fun( a, b), fun( b, c) ) ) ; A) B) 8 C) 9 D) 7 ( 28) : int n = 0, * p = &n, * * q = &p;,, A) p = 1; B) * q = 2; C) q = p; D) * p = 5; ( 29) void f( int v, int w) { int t; t = v; v = w; w = t; { int x = 1, y = 3, z = 2; if( x > y) f( x, y) ; else if( y > z) f( y, z) ; else f( x, z) ; printf( % d, % d, % d \ n, x, y, z) ; A) 1, 2, 3 B) 3, 1, 2 C) 1, 3, 2 D) 2, 3, 1 ( 30) int a[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, * p = &a[ 3], b; b = p[ 5] ; b A) 5 B) 6 C) 8 D) 9 ( 31) { char a[ ] = abcdefg, b[ 10] = abcdefg ; printf( % d % d \ n, sizeof( a), sizeof( b) ) ; A) 77 B) 88 C) 810 D) 1010 ( 32) void swap1( int c[ ] ) { int t; t = c[ 0] ; c[ 0] = c[ 1] ; c[ 1] = t; void swap2( int c0, int c1) { int t; t = c0; c0 = c1; c1 = t; { int a[ 2] = {3, 5, b[ 2] = {3, 5 ; swap1( a) ; swap2( b[ 0], b[ 1] ) ; printf( % d% d% d% d \ n, a[ 0], a[ 1], b[ 0], b[ 1] ) ; : A) B) C) D) ( 33) ( 5) 4 ( 11 )

58 void sum( int * a) { a[ 0] = a[ 1] ; { int aa[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, i; for( i = 2; i >= 0; i - - ) sum( &aa[ i] ) ; printf( % d \ n, aa[ 0] ) ; A) 4 B) 3 C) 2 D) 1 ( 34) int f( int b[ ] [ 4] ) { int i, j, s = 0; for( j = 0; j < 4; j ++ ) { i = j; if( i > 2) i = 3 - j; s += b[ i] [ j] ; return s; { int a[ 4] [ 4] = { {1, 2, 3, 4, {0, 2, 4, 6, {3, 6, 9, 12, {3, 2, 1, 0 ; printf( % d \ n, f( a) ) ; : A) 12 B) 11 C) 18 D) 16 ( 35) #include < stdio. h > char a[ 10], * b = a; a A) gets( a) B) gets( a[ 0] ) ; C) gets( &a[ 0] ) ; D) gets( b) ; ( 36) { char * p[ 10] = { abc, aabdfg, dcdbe, abbd, cd ; printf( % d \ n, strlen( p[ 4] ) ) ; A) 2 B) 3 C) 4 D) 5 ( 37) int a = 2; int f( int * a) { return ( * a) ++ ; { int s = 0; { int a = 5; s += f( &a) ; s += f( &a) ; printf( % d \ n, s) ; A) 10 B) 9 C) 7 D) 8 ( 5) 5 ( 11 )

59 ( 38) #define f( x) x* x { int i; i = f( 4 + 4) / f( 2 + 2) ; printf( % d \ n, i) ; A) 28 B) 22 C) 16 D) 4 ( 39) typedef struct S { int g; char h; T; A) S B) T C) S struct D) T struct S ( 40) struct STU { char name[ 10] ; int num; ; void f1( struct STU c) { struct STU b = { LiSiGuo, 2042 ; c = b; void f2( struct STU * c) { struct STU b = { SunDan, 2044 ; * c = b; { struct STU a = { YangSan, 2041, b = { Wang Yin, 2043 ; f1( a) ; f2( &b) ; printf( % d% d \ n, a. num, b. num) ; A) B) C) D) ( 41) { unsigned char a, b; a = 4 3; b = 4 & 3; printf( % d % d \ n, a, b) ; A) 70 B) 07 C) 11 D) 430 ( 42) : * * * * { int i, j; * * * * * * * * * * * * ( 5) 6 ( 11 )

60 for( i = 1; i <= 4; i ++ ) { for( j = 1; j <= 4 - i; j ++ ) printf( ) ; for( j = 1; j <= ; j ++ ) printf( * ) ; printf( \n ) ; A) i B) 2* i - 1 C) 2* i + 1 D) i + 2 ( 43) void sort( int a[ ], int n) { int i, j, t; for ( i = 0; i < n - 1; i += 2) for ( j = i + 2; j < n; j += 2) if( a[ i] < a[ j] ) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; { int aa[ 10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, i; sort( aa, 10) ; for( i = 0; i < 10; i ++ ) printf( % d,, aa[ i] ) ; printf( \n ) ; : A) 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, B) 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, C) 9, 2, 7, 4, 5, 6, 3, 8, 1, 10, D) 1, 10, 3, 8, 5, 6, 7, 4, 9, 2, ( 44), ( ) : A) char s[ 10] = abcdefg ; B) char t[ ] = abcdefg, * s = t; C) char s[ 10] ; s = abcdefg ; D) char s[ 10] ; strcpy( s, abcdefg ) ; ( 45) #include < string. h > main( int argc, char * argv[ ] ) { int i, len = 0; for( i = 1; i < argc; i += 2) len += strlen( argv[ i] ) ; printf( % d \ n, len) ; ex. exe, ex abcd efg h3 k44 A) 14 B) 12 C) 8 D) 6 ( 46) void f( int a[ ], int i, int j) { int t; if( i < j) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; f( a, i + 1, j - 1) ; { int i, aa[ 5] = {1, 2, 3, 4, 5 ; f( aa, 0, 4) ; for( i = 0; i < 5; i ++ ) printf( % d,, aa[ i] ; printf( \ n ) ; ( 5) 7 ( 11 )

61 A) 5, 4, 3, 2, 1 B) 5, 2, 3, 4, 1, C) 1, 2, 3, 4, 5 D) 1, 5, 4, 3, 2, ( 47) struct STU { char name[ 10] ; int num; int Score; { { struct STU s[ 5] = {{ YangSan, 20041, 703, { LiSiGuo, 20042, 580, { WangYin, 20043, 680, { SunDan, 20044, 550, { Penghua, 20045, 537, * p[ 5], * t; int i, j; for( i = 0; i < 5; i ++ ) p[ i] = &s[ i] ; for( i = 0; i < 4; i ++ ) for( j = i + 1; j < 5; j ++ ) if( p[ i] - > Score > p[ j] - > Score) {t = p[ i] ; p[ i] = p[ j] ; p[ i] = t; printf( % d % d \ n, s[ 1]. Score, p[ 1] - > Score) ; A) B) C) D) ( 48) #include < stdlib. h > struct NODE { int num; struct NODE * next; ; { struct NODE * p, * q, * r; int sum = 0; p = ( struct NODE * ) malloc( sizeof( struct NODE) ) ; q = ( struct NODE * ) malloc( sizeof( struct NODE) ) ; r = ( struct NODE * ) malloc( sizeof( struct NODE) ) ; p - > num = 1; q - > num = 2; r - > num = 3; p - > next = q; q - > next = r; r - > next = NULL; sum += q - > next - > num, sum += p - > num; printf( % d \ n, sum) ; A) 3 B) 4 C) 5 D) 6 ( 49) #include < stdio. h > { FILE * fp; int i, k = 0, n = 0; fp = fopen( d1. dat, w ) ; for( i = 1; i < 4; i ++ ) fprintf( fp, % d, i) ; fclose( fp) ; fp = fopen( d1. dat, r ) ; fscanf( fp, % d% d, &k, &n) ; printf( % d% d \ n, k, n) ; fclose( fp) ; ( 5) 8 ( 11 )

62 A) 1 2 B) C) 1 23 D) 0 0 ( 50) ( : fseek( fp, - 2L* sizeof( int), SEEK END) ; 2* sizeof( int) ) #include < stdio. h > { FILE * fp; int i, a[ 4] = { 1, 2, 3, 4, b; fp = fopen( data. dat, wb ) ; for( i = 0; i < 4; i ++ ) fwrite( &a[ i], sizeof( int), 1, fp) ; fclose( fp) ; fp = fopen( data. dat, rb ) ; fseek( fp, - 2L* sizeof( int), SEEK END) ; fread( &b, sizeof( int), 1, fp) ; / * sizeof( int) b * / fclose( fp) ; printf( % d \ n, b) ; A) 2 B) 1 C) 4 D) 3 ( 2, 40 ) 120, ( 1), 1 ( 2),, 2 ( 3),, 3 ( 4),, 4, ( 5),, 5 ( 6) A ASCII 65, 6 char ch = B ; printf( % c % d \ n, ch, ch) ; ( 7) int n1 = 10, n2 = 20; printf( 7, n1, n2) ; n1 n2,, n1 = 10 n2 = 20 ( 8) { int t = 1, i = 5; for( ; i >= 0; i - - ) t* = i; printf( % d \ n, t) ; 8 ( 9) { int n = 0, m = 1, x = 2; if(! n) x - = 1; if( m) x - = 2; if( x) x - = 3; printf( % d \ n, x) ; ( 5) 9 ( 11 )

63 9 ( 10) #include < stdio. h > { char ch1, ch2; int n1, n2; ch1 = getchar( ) ; ch2 = getchar( ) ; n1 = ch1 - ( ) ; n2 = n1* 10 + ( ch2 - ( ) ) ; printf( % d \ n, n2) ; : 12 < >, 10 ( 11) void f( int y, int * x) { y = y + * x; * x = * x + y; { int x = 2, y = 4; f( y, &x) ; printf( % d % d \ n, x, y) ; 11 ( 12) fun x n double fun( double x, int n) { int i; double y = 1; for ( i = 1; i <= n; i ++ ) y = y* x; return y; m a b, fun : m = a 4 + b 4 - ( a + b) 3 12 ( 13) rotate : n n A A, : A = #define N 4 void rotate( int a[ ] [ N] ) { int i, j, t; for( i = 0; i < N; i ++ ) for( j = 0; 13; j ++ ) { t = a[ i] [ j] ; 14; A = a[ j] [ i] = t; ( 14) sstrcpy( ), t s, s void sstrcpy( char * s, char * t) { while ( * s ++= 15) ; { char strl[ 100], str2[ ] = abcdefgh ; sstrcpy( str1, str2) ; printf( % s \ n, str1) ; ( 5) 10 ( 11 )

64 ( 15) : 16 #include < string. h > char* ss ( char* s) { return s + strlen( s) /2; { char* p, * str =abcdefgh ; p = ss( str) ; printf(% s \ n, p) ; ( 16) : 17 int f( int a[ ], int n) { if( n > 1) return a[ 0] + f( &a[ 1], n - 1) ; else return a[ 0] ; { int aa[ 3] = {1, 2, 3, s; s = f( &aa[ 0], 3) ; printf(% d \ n, s) ; ( 17) P double, : #include < stdio. h > { double* p; p = ( double* ) malloc 18; p[ 0] = 1. 5; p[ 1] = 2. 5; p[ 2] = 3. 5; printf(% f% f% f\ n, p[ 0], p[ 1], p[ 2] ) ; ( 18) 19 #include < string. h > typedef struct student{ char name[ 10] ; long sno; float score; STU; { STU a = {zhangsan, 2001, 95, b = {Shangxian, 2002, 90, c = {Anhua, 2003, 95, d, * p = &d; d = a; if( strcmp( a. name, b. name) > 0) d = b; if( strcmp( c. name, d. name) > 0) d = c; printf(% ld% s \ n, d. sno, p - > name) ; ( 19) sum S = 1 + x + x2 2! + x3 3! + + xn n! double sum( double x, int n) { int i; double a, b, s; 20 for( i = 1; i <= n; i ++ ) { a = a* x; b = b* i; s = s + a / b; return s; ( 5) 11 ( 11 )

65 C,,,,,, * * *,, * * *

66 ( 6) C ( 120, 100 ) ( ( 1) ( 40) 1, ( 41) ( 50) 2, 60 ) A) B) C) D),, ( 1) A) B) C) D) ( 2), A) B) C) D) ( 3) : A) ABCDEF B) DABECF C) BDAECF D) DBEFCA ( 4) A) B) C) D) ( 5) A), B), C), D), ( 6), ( ) A) B) C) D) ( 7) A) B) C) D) ( 8) ( 6) 1 ( 11 )

67 A) B) C) D) ( 9), ( ), A) B) C) D) ( 10) A) B) C) D) ( 11) C A) B) C) D) ( 12), A) B) C) D) ( 13) A) char a = A b = B ; B) float a = b = 10. 0; C) int a = 10, * b = &a; D) float * a, b = &a; ( 14), A) 1234 B) 1 2 C) int 2 D) 2 int ( 15) double a, b; int w; long c;, A) a = a + b = b ++ B) w% ( ( int) a + b) C) ( c + w) % ( int) a D) w = a == b; ( 16) { int m = 3, n = r, x; x =- m ++ ; x = x + 8 / ++ n; printf( " % d \ n", x) ; A) 3 B) 5 C) - 1 D) - 2 ( 17) { char a = a, b; printf( " % c, ", ++ a) ; printf( " % c \ n", b = a ++ ) ; A) b, b B) b, c C) a, b D) a, c ( 18) { int m = 0256, n = 256; printf( " % o% o\ n", m, n) ; ( 6) 2 ( 11 )

68 A) B) C) D) ( 19) { int a = 666, b = 888; printf( " % d \ n", a, b) ; A) B) 666 C) 888 D) 666, 888 ( 20) { int i; for( i = 0; i < 3; i ++ ) switch( i) { case0: printf( " % d", i) ; case2: printf( " % d", i) ; default: printf( " % d", i) ; A) B) C) D) 012 ( 21) x y, x - y < 10 A) abs( x - y) < 10 B) x - y > - 10&&x - y < 10 C)! ( x - y) < - 10! ( y - x) > 10 D) ( x - y) * ( x - y) < 100 ( 22) { int a = 3, b = 4, c = 5, d = 2; if( a > b) if( b > c) printf( " % d", d +++ 1) ; else printf( " % d", ++ d + 1) ; printf( " % d \ n", d) ; A) 2 B) 3 C) 43 D) 44 ( 23), A) if( a) printf( " % d \ n", x) ; else printf( " % d \n", y) ; B) if( a == 0) printf( " % d \ n", y) ; else printf( " % d \n", x) ; C) if( a! = 0) printf( " % d \n", x) ; else printf( " % d \ n", y) ; D) if( a == 0) printf( " % d \ n", x) ; else printf( " % d \ n", y) ; ( 24) ( 6) 3 ( 11 )

69 C) i = 1; p = 1; while( i <= 5) { p* = i; i ++ ; D) i = 1; p = 1; do{p* = i; i ++ ; while( i <= 5) ; ( 26) { int i = 0, s = 0; for( ; ; ) { if( i == 3i == 5) continue; if( i == 6) break; i ++ ; s += i; ; printf( " % d \ n", s) ; A) 10 B) 13 C) 24 D) ( 25), 5!, A) for( i = 1, p = 1; i <= 5; i ++ ) p* = i; B) for( i = 1; i <= 5; i ++ ) { p = 1; p* = i; { char a, b, c, d; scanf( " % c, % c, % d, % d", &a, &b, &c, &d) ; printf( " % c, % c, % c, % c \ n", a, b, c, d) ; : 6, 5, 65, 66 < > A) 6, 5, A, B B) 6, 5, 65, 66 C) 6, 5, 6, 5 D) 6, 5, 6, 6 ( 27) A) int a[ ] [ 3] ; B) int a[ ] [ 3] = {2* 3 ; C) int a[ ] [ 3] = { ; D) int a[ 2] [ 3] = { {1, {2, {3, 4 ; ( 28) int f( int a) { return a% 2; { int s[ 8] = {1, 3, 5, 2, 4, 6, i, d = 0; for( i = 0; f( s[ i] ) ; i ++ ) d += s[ i] ; printf( " % d \ n", d) ; A) 9 B) 11 C) 19 D) 21 ( 29) int c[ 4] [ 5], ( * p) [ 5] ; p = c; c A) p + 1 B) * ( p + 3) C) * ( p + 1) + 3 D) * ( p[ 0] + 2) ( 6) 4 ( 11 )

70 ( 30) { int a = 7, b = 8, * p, * q, * r; p = &a; q = &b; r = p; p = q; q = r; printf( " % d, % d, % d, % d \ n", * p, * q, a, b) ; A) 8, 7, 8, 7 B) 7, 8, 7, 8 C) 8, 7, 7, 8 D) 7, 8, 8, 7 ( 31) s1 s2, : s1 s2, S; A) if( s1 > s2) S; B) if( strcmp( s1, s2) ) S; C) if( strcmp( s2, s1) > 0) S; D) if( strcmp( s1, s2) > 0) S; ( 32) int x[ 6] = {2, 4, 6, 8, 5, 7, * p = x, i; x 6, A) for( i = 0; i < 6; i ++ ) printf( " % 2d", * ( p ++ ) ) ; B) for( i = 0; i < 6; i ++ ) printf( " % 2d", * ( p + i) ) ; C) for( i = 0; i < 6; i ++ ) printf( " % 2d", * p ++ ) ; D) for( i = 0; i < 6; i ++ ) printf( " % 2d", ( * p) ++ ) ; ( 33) #include < stdio. h > { int a[ ] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,, * p = a + 5, * q = NULL; * q = * ( p + 5) ; printf( " % d % d \ n", * p, * q) ; A) B) 6 6 C) 6 11 D) 5 10 ( 34) int a[ 3] [ 2] = {1, 2, 3, 4, 5, 6, * p[ 3] ; p[ 0] = a[ 1] ; * ( p[ 0] + 1) A) a[ 0] [ 1] B) a[ 1] [ 0] C) a[ 1] [ 1] D) a[ 1] [ 2] ( 35) { char str[ ] [ 10] = {" China", " Beijing", * p = str; printf( " % s \n", p + 10) ; A) China B) Beijing C) ng D) ing ( 36) ( 6) 5 ( 11 )

71 { char s[ ] = " ABCD", * p; for( p = s + 1; p < s + 4; p ++ ) printf( " % s \ n", p) ; A) ABCD B) A C) B D) BCD BCD B C CD CD C D D D D ( 37), funa funb, funb funa, A) B) C) D) C ( 38) : int i, a[ 10], * p;, A) p = 100; B) p = a[ 5] ; C) p = a[ 2] + 2; D) p = a + 2; ( 39) A) static, B) static, C), D) ( 40) : char c1 = 92, c2 = 92;, A) c1^c2 B) c1&c2 C) c1 c2 D) c1 c2 ( 41) fun void * fun( ) ; A) fun B) fun C) fun D) fun, ( 42) { char s[ ] = " Yse \n / No", * ps = s; puts( ps + 4) ; * ( ps + 4) = 0; puts( s) ; ( D ) A) n / No B) / No C) n / No D) Yes Yes Yes / No / No / No Yes ( 43) { unsigned int a; int b =- 1; a = b; ( 6) 6 ( 11 )

72 printf( " % u", a) ; A) - 1 B) C) D) ( 44) void fun( int * a, int i, int j) { int t; if( i < j) { t = a[ i] ; a[ i] = a[ j] ; a[ j] = t; i ++ ; j - - ; fun( a, i, j) ; { int x[ ] = {2, 6, 1, 8, i; fun( x, 0, 3) ; for( i = 0; i < 4; i ++ ) printf( " % 2d", x[ i] ) ; printf( " \n" ) ; A) B) C) D) ( 45) struct student { int age; char num[ 8] ; struct student stu[ 3] = { {20, "200401", {21, " ", {19, " " ; struct student * p = stu; ; A) ( p ++ ) - > num B) p - > num C) ( * p). num D) stu[ 3]. age ( 46) { int x[ ] = {1, 3, 5, 7, 2, 4, 6, 0, i, j, k; for( i = 0; i < 3; i ++ ) for( j = 2; j >= i; j - - ) if( x[ j + 1] > x[ j] ) { k = x[ j] ; x[ j] = x[ j + 1] ; x[ j + 1] = k; for( i = 0; i < 3; i ++ ) for( j = 4; j < 7 - i; j ++ ) if( x[ j] > x[ j + 1] ) { k = x[ j] ; x[ j] = x[ j + 1] ; x[ j + 1] = k; for( i = 0; i < 8; i ++ ) printf( " % d", x[ i] ) ; printf( " \n" ) ; A) B) C) D) ( 6) 7 ( 11 )

73 ( 47) #include < stdio. h > { FILE * fp1; fp1 = fopen( " f1. txt", " w" ) ; fprintf( fp1, " abc" ) ; fclose( fp1) ; f1. txt : good, f1. txt A) goodabc B) abcd C) abc D) abcgood ( 48) ( 50) :,, #include < stdlib. h > struct node { char data; struct node * next; ; ( 48) CreatList( char* s) { struct node * h, * p, * q; h = ( struct node* ) malloc( sizeof( struct node) ) ; p = q = h; while( * s! = " \ 0" ) { p = ( struct node* ) malloc( sizeof( struct node) ) ; p - > data = ( 49) ; q - > next = p; q = ( 50) ; s ++ ; p - > next = " \0" ; return h; { char str[ ] = " link list" ; struct node* head; head = CreatList( str) ; ( 48) A) char* B) struct node C) struct node* D) char ( 49) A) * s B) s C) * s ++ D) ( * s) ++ ( 50) A) p - > next B) p C) s D) s - > next ( 2, 40 ) 120, ( 1), 1 ( 2),, 2 ( 3), 3 ( 6) 8 ( 11 )

74 ( 4),, 4 ( 5), 5 ( 6) 6 int i = 9; printf( " % o\ n", i) ; ( 7) 7 { int a, b, c; a = 25; b = 025; c = 0x25; printf( " % d % d % d \ n", a, b, c) ; ( 8) 8 { int p[ 7] = {11, 13, 14, 15, 16, 17, 18 ; int i = 0, j = 0; while( i < 7&&p[ i] % 2 == 1) j += p[ i ++ ] ; printf( " % d \ n", j) ; ( 9) 9 { int x = 1, y = 0, a = 0, b = 0; switch( x) { case 1: switch( y) { case 0: a ++ ; break; case 1: b ++ ; break; case2: a ++ ; b ++ ; break; printf( " % d % d \ n", a, b) ; ( 10) 10 { int a[ 4] [ 4] = { {1, 2, 3, 4, {5, 6, 7, 8, {11, 12, 13, 14, {15, 16, 17, 18 ; int i = 0, j = 0, s = 0; while( i ++ < 4) { if( i == 2 i == 4) continue; j = 0; do{ s += a[ i] [ j] ; j ++ ; while( j < 4) ; ( 6) 9 ( 11 )

75 printf( " % d \ n", s) ; ( 11) 11 { char a[ ] = " Language", b[ ] = " Programe" ; char * p1, * p2; int k; p1 = a; p2 = b; for( k = 0; k <= 7; k ++ ) if( * ( p1 + k) == * ( p2 + k) ) printf( " % c", * ( p1 + k) ) ; ( 12) 12 { char a[ ] = " ", * p; int i = 0; p = a; while( * p) { if( i% 2 == 0) * p = * ; p ++ ; i ++ ; puts( a) ; ( 13), for 13 #define N 2 #define M N + 1 #define K M + 1* M/2 { int i; for( i = 1; i < K; i ++ ) { ( 14) SunFun 10 f( x) f( x) = x = 0 x2 + 1, F { printf( " The sum = % d \ n", SunFun( 10) ) ; SunFun( int n) { int x, s = 0; for( x = 0; x <= n; x ++ ) s += F( 14) ; return s; F( int x) { return( 15) ; ( 15),, ( 6) 10 ( 11 )

展开

新版明解Ｃ言語入門編

新版明解Ｃ言語入門編 328, 4, 110, 189, 103, 11... 318. 274 6 ; 10 ; 5? 48 & & 228! 61!= 42 ^= 66 _ 82 /= 66 /* 3 / 19 ~ 164 OR 53 OR 164 = 66 ( ) 115 ( ) 31 ^ OR 164 [] 89, 241 [] 324 + + 4, 19, 241 + + 22 ++ 67 ++ 73 += 66