题库精简
2012.3二级C上机专用
最新上机题库集选精简版
本套题使用方法如下:填空部分关健字查找题目,题库为成套,填空1套对应改错1程序1。例如:你抽到了4题,红色部分代表4题填空题第一个空前面的部分关健字代码,后两个空没有列举。下面粉色部分为三个空的答案,改错题及编程题也是4题。(注意不要把分号看成冒号)
请仔细研究
一、填空题
1、 t = ___1___;
t *= (-1.0)*x/___2___;
(1)x (2)n (3)fabs(t)
2、 switch(___1___)
(1)n%10 (2)break (3)break
3、if(t%2==__1__)
(1)0 (2)10*x (3)n/10
4、rmax=a[i][j]; c= __1__ ; }
(1) j (2)0 (3)i++
5、void fun(char (*ss) __1__, int k) (1) [M] (2)N (3)0
6、void fun(int (*t)___1___ )
(1)[N](2)t[i][j] (3)t[j][i]
7、void fun(int (*a)[N], int __1__) (1) k (2)N (3)a[k][i]
8、while(t<=__1__){
(1) 999 (2)t/10 (3)x
9、 ___1___;
(1) sum=0 (2)t[i][i] (3)1 10、___1___ fun(char ch)
(1) char (2)ch<='9' (3)'0' 11、s=0; i=__1__;
(1) 0 (2)i++ (3)2.*i 12、while (!feof(__1__))
(1) fp (2)== (3)fp
13、for(i=0; i< __1__ ; i++)
(1) N (2)substr (3)0
14、for(p=1; p<= __1__; p++)
(1) k (2)N-1 (3)temp 15.t=(a>b)?(b>c?b :(a>c?c:___1___) ):((a>c)?___2___:((b>c)?c:___3___)) ;
(1) a (2)a (3)b
16 if ((ch>='a')___1___(ch<='z')) (1) && (2)'A' (3)ch
17、if(isdigit(*s)) sum+=*s- __1__ ;
(1)48 (2)s++ (3)sum
18、f = ___1___;
(1) 1 (2)-1 (3)t
19、if(n>=len) strcpy(__1__);
(1) t,s (2)s[i] (3)0
20、__1__ fun(struct student *a)
(1)struct student * (2)a->score[i]
(3)a
21、max = min = ___1___;
(1) a[i] (2)a[j] (3)a[j]
22、void fun(int ___1___ , int n)
(1) t[][N] (2)i=0;i 23、void fun(int ___1___, int n) (1) *a (2)2 (3)i+1 24、 f = 1.0+___1___; (1) x (2)n (3)t 25、 t = ___1___;(注意和第1题不一 样) for (i=___2___; i (1) 1 (2)1 (3)i 26、b__1__ = 10004; (1) ->sno (2)->name (3)&t 27、k=__1__;(注意和第49题不一样) t=__2__; (1) 1 (2)2*i (3) (-1) 28、s=__1__; (1) 0 (2)n (3)(t*t) 29、 ch=tolower(__1__); (1) *s (2)1 (3)k[n] 30、__1__ t; (1) struct student (2)n-1 (3)a[i].name,a[j].name 31、 if (___1___== 0) { (1) a[i]%2 (2)a[j] (3) j 32、{ t=*n % __1__; (1) 10 (2)0 (3)x 33、for(i=0; i< __1__ ; i++)(注意有 相类似的) if(len<= __2__) (1) N (2)k (3)ss[i] 34、 __1__ ; flag=1;} (1) n++ (2)0 (3)s++ 35、 t[j]=__1__; j++;} (1) s[i] (2) k (3)0 36、for(i=0; i< __1__ ; i++) if(strcmp(ss[i],t)==0) return__2__ ;(注意有类似的) (1) N (2)i (3)-1 37、lp= __1__ ; (1) s (2)--(注意是2个减号) (3) return 0 38、x=__1__/4; (1) 3.(注意要打上点) (2) > (3)(2*i+1) 39、for (i=0; i<___1___; i++) a[i] = a[n-1-___2___]; (注意有类似题) (1) n/2 (2)i (3)a[n-i-1] 40、b = __1__; (1) a (2)https://www.360docs.net/doc/964146696.html, (3)score[i] 41、 for (___1___; j (1) j=2 (2)i (3)j 42、i=__1__; (1) 1 (2)s (3)i*10 43、__1__ fun(struct student a) (1) struct student (2)https://www.360docs.net/doc/964146696.html, (3)a.score[i] 44、p=(n%2==0)?n/2:n/2+___1___; (1) 1 (2)i (3)a[p+i] 45、 if (a[i]%2==___1___) (1) 1 (2)j++ (3)j 46、n=__1__; (1) 0 (2)x (3)t++ 47、 *(t+n)= __1__ ; n++; } (1) *s (2)s++ (3)n 48、#define OK(i, t, n) ((___1___%t==0) && (i/t (1) i (2)t++ (3)count 49、k= __1__ ;(注意有类似题) if(strlen(ps[k]) < strlen(__2__) ) k=j; (1) i (2)ps[j] (3) tp 50 for (j=a[i]*2; j<=n; j+=___1___) (1)a[i] (2)a[i] (3)0 二、改错题 1.(1)for(i=1;i<=y;i++) (2)t=t%1000; 2.(1)if(t==0) (2) *zero=count; 3.(1)*t=0; (2) if(d%2!=0) 4.(1)for(i=2;i<=m;i++) (2)y-=1.0/i/i; 5.(1)t=1; (2) return(2*s); 6.(1)#define FU(m,n) ((m)/(n)) (2)return (value); 7.(1)for(i = strlen( t )-1; i;i--) (2)if(t[j] > t[j + 1 ] ) 8.(1)void fun(long s,long *t) (2)while(s>0) 9.(1)double r; (2) while(fabs(m-n)>0.001) 10.(1)b[k]=*p; (2) b[k]=' ';k++; 11.(1)void fun (char *s, char *t) (2)t[2*d] = 0; 12.(1)n=strlen(aa); (2)ch=aa[i]; 13.(1)fun(int x,int y, int z) (2)return j; 14.(1) void fun(int a[][M], int m) (2)a[j][k]=(k+1)*(j+1); 15.(1)c=tolower(c)(注:c小写); (2)c=c+5; 16.(1) void fun(int *a) (2)a[j]=a[j-1]; 17.(1) if ((k%13 == 0) || (k%17 ==0)) (注:双等号) (2)}(注:横线去掉) 18.(1)for(i=1;i<=3;i++) (2)if(k>=0&&k<=6) 19.(1) if(i%k==0) (2)if(k>=i) 20.(1)char *fun(char (*sq)[M] ) (2)return sp; 21.(1)switch(g) (2)case 1: return 1; case 2:return 1; 22.(1)fun(int a[],int m) (2)else if(m>a[mid]) 23.(1) sum=0; (2)if((i+1)%5==0) 24.(1)d=1;s=0; (2)d=d/10; 25.(1) k=i; (2)c=k; 26.(1)double fun(double a,double x0) (2)if(fabs(x1-x0)>0.00001) 27.(1)k++; (2)if(m==k) 28.(1) for(i=0;str[i];i++) (2)if(substr[k+1]==0) 29.(1) float fun(int k) (2)return s; 30.(1) q=p+i; (2)while(q>p) 31.(1) fun (int n) (2)if(n==1) 32.(1) if (n==0) (2)result *= n-- ; 33.(1) int k=0; (2)while( *p || *q ) 34.(1) t+=s[k]; (2)*aver=ave; 35.(1) while(*w)(2)if(*r==*p) 36.(1) a2=k/10;(注意是十) (2)return i; 37.(1) double fun (int n) (2)c=a;a+=b;b=c; 38.(1)double fun(int n) (2)s=s+(double)a/b; 39.(1) n= *p-'0';(2)n=n*8+*p-'0'; 40.(1) s[j++]=s[i];(2)s[j]=0; 41.(1)sum=0;j=0;(2)if(sum%4==2) 42.(1) int fun(int n,int xx[][M]) (2)printf("%d",xx[i][j]); 43.(1) if(p==n) return -1; (2)a[i]=a[i+1]; 44.(1)float k; (2)if(*c>*a) 45.(1) t=a;a=b;b=t;(2)return(b); 46.(1) int i,sl; (2)t[i]=s[sl-i-1]; 47.(1) int j, c=0; double xa=0.0; (2)if (x[j]>=xa) 48.(1) int fun(int a,int b,int c) (2)else return 1; 49.(1) double fun(int n) (2)return sum; 50.(1) y=1;(2) d=a-i; 三、编程题 1、int i=0; double s=1,a=1; while(fabs(a)>0.000001) { a=a*(0.5-i)*x/(i+1); s+=a; i++; } return s; 2、int i; double s=0,a=1; for(i=1;i<=n;i++) { a=a/i; s+=a; } return s; 3、while(*p1) p1++; while(*p2) { *p1=*p2; p1++; p2++; } *p1=0; 4、int i=0,s=0,n=0; for(i=0;i s/=m; for(i=0;i { if(score[i] { below[n]=score[i]; n++; } } return n; 5、int i=0,k=0; char *t=a; while(*t=='*') { k++; t++; } t=a; if(k>n) t=a+k-n; while(*t) { a[i]=*t; i++; t++; } a[i]='\0'; 6、int i=0,j=0; while(a[i]=='*') i++; while(a[i]) { a[j]=a[i]; i++; j++; } a[j]=0; 7、int i=1; while(ss[i-1]&&ss[i]) { if(ss[i]>='a'&&ss[i]<='z') ss[i]+='A'-'a'; i+=2; } 8、int i,j; STREC strTemp;