上海市计算机二级考试（C语言）复习资料题目(6)

{ case 0:

case 1: putchar(c+4);

case 2: putchar(c+3);break; case 3: putchar(c+2);

case 4: putchar(c+1);break; }} printf(\}

8. 以下程序运行时,输入10个整型数,输出结果是 。 int a,b;

void found_value(int array[],int n) { int *p,*array_end; array_end=array+n; a=b=*array;

for (p=array+1;pa) a=*p;

else if (*p

main()

{ int i,number[10];

printf(\ for(i=0;i<10;i++)

scanf(\ found_value(number,10); printf(\}

9. 执行该程序时,输出结果是 。 main() { int y=10;

do { y--;} while (--y); printf(\}

10. 运行以下程序，从键盘上输入china#，则输出结果是

#include main()

{ int v1=0,v2=0; char ch;

while ((ch=getchar())!='#') switch(ch)

{ case 'a' : case 'h' :

default : v1++; case 'o' : v2++;

}

printf(\}

11. #include void printletter() { static int c=57; if (c>=48) { putchar(c); c--;

printletter(); } }

main()

{ printletter(); }

12. main()

{ int a[5]={1,3,5,7,9}; int *num[5]; int **p,i;

for (i=0;i<5;i++) num[i]=&a[i]; p=num;

for (i=0;i<5;i++)

{ printf(\}

13. main()

{ int fun (int *, int ); int j = 1 , m =4, k ; k = fun(&j, m ) ;

printf(“j=%d m=%d\\n”,j,m); printf(“The first k: %d\\n”, k ); k = fun(&j, m);

printf(“j=%d m=%d\\n”,j,m); printf(“The second k: %d\\n”, k) ; }

int fun (int *x , int y ) { static int k = 2; k += *x + 1; *x = k- y; return k; }

14. #include

int count, position, data;

void search( int *p, int n, int st )

{ if ( *p == data ) { count ++;

position = st;

}

if ( n > 1 )

search( p+1, n-1, st+1 );

}

main()

{ int a[5] = { 10, 30, 50, 30, 20 }; count = 0; data = 25;

search( a, 15, 1 );

printf( \}

15. int sumadd( int func, int data )

{ static int sum; switch ( func )

{ case 0 : sum = data; break; case 1 : sum += data; break; case 2 : sum -= data; break; }

return sum; }

main() { sumadd( 1, 10 );

printf( ―%d‖, sumadd(2,10));

sumadd( 2, 20 );

printf( ―%d‖, sumadd(2,10)); }

16. void s ( int a[], int n )

{ int i, j, t ;

for ( i = 0; i < n ; i ++ )

{ for ( t = a[i], j = i - 1 ; j >= 0 && t < a[j] ; j -- )

a[j+1] = a[j];

a[j+1] = t ;

} }

main()

{ int i , b[6] ={24, 12, 14, 32, 22, 34 } ;

s ( b, 6) ; for ( i = 0; i < 6 ; i ++)

printf(“M”, b[i] );

printf(“\\n”) ; }

17. void p ( int k )

{ int m , i;

for ( m = 2; m <= k ; m ++) { for ( i = 2; i <= m; i ++)

if ( !(m % i )) break ;

if ( i = = m ) printf(“M”, m); }

printf( “\\n”);

}

main()

{ p (13) ; }

18. ＃include

main()

{ int a[]={0,10,20,30,}; int n=0, *p; p=a+1; n+=*(p++); n+=(*p)++; n+=*(++p); n+=++(*p);

printf(―n=%d, a[]=%d, %d, %d, %d\\n‖, n, a[0], a[1], a[2], a[3]); }

19. #include

void strselect(char *strs[], int n, char *dest) { int i;

for(i=0; i

*(dest+i)=*(strs[i]+i); *(dest+i)=’\\0’; }

main()

{ char *strs[]={“First”, “Second”, “Third”, “Forth”, “Fifth”}; char rst[81];

strselect(strs, 5, rst); printf(“%s\\n”, rst); }

20. #include struct node { int n;

struct node *next; };

void insert(struct node *head, int newn) { struct node *p, *q ;

for(p=head; p->next!=NULL; p=p->next ) { q=p->next;

if((newn)<(q->n)) break; }

q=(struct node*)malloc(sizeof(struct node)); q->n=newn;

q->next=p->next; p->next=q; } main()

{ struct node head, *p, *q; head.next=NULL; insert(&head, 56);

insert(&head, 38); insert(&head, 72); insert(&head, 49);

for(p=head.next; p!=NULL; p=p->next) printf(“%d ”, p->n); printf(“\\n”);

for(p=head.next; p!=NULL;) { q=p;

p=p->next; free(q); } }

21. #include #include main()

{ int fun(char*,int); char *p;

p=\ fun(p,strlen(p)); puts(p); }

int fun(char *w,int n) { char t,*s1,*s2; s1=w; s2=w+n-1; while (s1

22. long f(int i) { if (i==0) return 0;

else if (i==1) return 1; return f(i-1)+f(i-2); }

main() { long k; k=f(5);

printf(\}

23. 该程序的执行结果是 long fun(int n) { long s;

if (n==1||n==2) s=2; else s=n-fun(n-1); return s;