全國計(jì)算機(jī)等級(jí)考試二級(jí)教程--C語言程序設(shè)計(jì)課后習(xí)題答案

1、.全國計(jì)算機(jī)等級(jí)考試二級(jí)教程-c 語言程序設(shè)計(jì)課后習(xí)題答案第一章 1.1 exe 1.2 c obj exe 1.3 順序選擇 循環(huán) 第二章 一. 選擇題2.1 b 2.2 d 2.3 b 2.4 a 2.5 c 2.6 a 2.7 b 2.8 b 2.9 d 2.10 c 2.11 b 2.12 b 2.13 a 二. 填空題2.14 11 12 2.15 4.2 4.2 2.16 定義執(zhí)行語句 2.17 關(guān)鍵字用戶標(biāo)識(shí)符2.18 int float double 2.19 float a1=1; float a2=1; 2.20 存儲(chǔ)單元2.21 3.5 2.22 (a*b)/c a*b/

2、c a/c*b 2.23 把常量 10 賦給變量 s2.24 位 1 或 0 三. 上機(jī)改錯(cuò)題2.28 #include stdio.h; 刪除行尾的 ; main(); / * main function * / 刪除) 后的 ;, 注釋中的 * 要緊靠“ /”,即應(yīng)為“ /* ”和“ */ ”函數(shù)開始處遺失了一個(gè)“ ”float r ,s ; /*/*r is radius*/,/* s is area of circuilar*/*/ 注釋符號(hào)不可嵌套使用r = 5.0 ; s = 3.14159 * r * r ; printf(%fn,s) 行尾遺失了“ ;”函數(shù)結(jié)束處遺失了一個(gè)“

3、”2.29 #include stdio.h main /* main function */ main后遺失了“ ()” float a,b,c,v; /*a,b,c are sides, v is volume of cube */ a=2.0; b=3.0; c=4.0 行尾遺失了“ ;”v=a*b*c; printf(%fn, v) 行尾遺失了“ ;” 第三章 一.選擇題3.1 c 3.2 c 3.3 d 3.4 c 3.5 d 3.6 b 3.7 c 3.8 d 3.9 a 3.10 b 3.11 c 3.12 d 3.13 d 3.14 a 3.15 c 3.16 c 3.17 c

4、 3.18 無答案3.19 c 3.20 b二. 填空題3.21 (1)-2002500(2)i=-200,j=2500 (3)i=-200 j=2500 3.22 12 0 0 3.23 一條語句; .3.24 ; 3.25 100,25.81,1.89234 100 25.81 1.89234 100 25.81 1.89234 3.26 x=127,x= 127,x= 177,x= 7f,x= 127 3.27 x=127,x=127 ,x=$127 ,x=$000127,x=%06d 3.28 a=513.789215,a= 513.79,a= 513.78921500,a= 513.

5、78921500 三. 編程題和改錯(cuò)題3.29 修改后的程序如下：main() double a,b,c,s,v; printf(input a,b,c:); scanf(%lf%lf%lf,&a,&b,&c); s =a*b; v=a*b*c; printf(a=%f,b=%f,c=%fn, a,b,c); printf(s=%f,v=%fn,s,v); 3.30 #include main() int a=560,b=60; printf(560 minute is %d hour and %d minute.n,a/b,a%b); 3.31 #include ma

6、in() int a,b; a=1500;b=350; printf(a div b is : %dn,a/b); printf(a mod b is : %dn,a%b); 3.32 #include main() double a,b,c,ave; printf (input 3 double number : n); scanf (%lf%lf%lf,&a,&b,&c); printf (%.1fn,(a+b+c)/3); 3.33 #include .void main() int a,b,c,t; printf( 請(qǐng)依次輸入整數(shù)a,b,c:); scanf(%

7、d%d%d,&a,&b,&c); printf(n你輸入的值是 : a=%d,b=%d,c=%dn,a,b,c); t=b;b=a;a=c;c=t; printf( 交換之后的值是 :a=%d,b=%d,c=%dn,a,b,c); 第四章 一. 選擇題4.1 a 4.2 a 4.3 a 4.4 d 4.5 c 4.6 a 4.7 b 4.8 c 4.9 d 4.10 c 二. 填空題 4.11 非 0 0 4.12 = =同級(jí) = ！= 同級(jí)4.13 ! & | 4.15 ! 4.16 a = b | a 4 | x -4 4.17 1 4.18 x 0 4.1

8、9 3 2 2 4.20 *# 三. 編程題 4.21 略4.22 #include /* 檢查日期的合法性*/ int checkdate(int year, int month, int day) if(year 2005) printf( 輸入的年份無效 !n); return 0; else if(month 12) printf( 輸入的月份無效 !n); return 0; else if(day 31) printf( 輸入的日期無效 !n); return 0; . else switch(month) case 4: case 6: case 9: case 11: if(d

9、ay 30) printf( 輸入的日期無效 !n); return 0; break; case 2: if(year%4 = 0 & year%100 != 0) | year%400 = 0) if(day 29) printf( 輸入的日期無效 !n); return 0; else if(day 28) printf( 輸入的出生日期無效!n); return 0; break; /* end of switch(m0)*/ return 1; void main() int y0, m0, d0; /* 生日*/int y1, m1, d1; /* 當(dāng)前日期*/ int y

10、ears, months, days; /* 實(shí)足年齡 */printf(請(qǐng)輸入學(xué)生的生日:); scanf(%d%d%d, &y0,&m0,&d0); .if(checkdate(y0, m0, d0) printf( 請(qǐng)輸入當(dāng)前日期 :); scanf(%d%d%d, &y1,&m1,&d1); /* 當(dāng)前日期合法性檢查*/ if(!checkdate(y1, m1, d1) return; else if(y0 y1) printf( 出生年份比當(dāng)前年份晚!n); return; else if(y0 = y1) if(m0 m1) pri

11、ntf( 出生年月比當(dāng)前年月晚!n); return; else if(m0 = m1) if(d0 d1) printf( 出生年月日比當(dāng)前年月日晚!n); return; /* 計(jì)算實(shí)足年齡*/ years = y1 - y0; months = m1 - m0; days = d1 - d0; /* 修正實(shí)足年齡天數(shù)*/ if(days 0) months-; switch(m1) case 1: .case 5: case 7: case 10: case 12: days += 30; break; case 2: case 4: case 6: case 8: case 9: ca

12、se 11: days += 31; break; case 3: if(y1%4 = 0 & y1%100 != 0) | y1%400 = 0) days += 29; else days += 28; break; /* end of switch(m1) */ /* end of if(days 0) */ /* 修正實(shí)足年齡月數(shù)*/if(months 0) months += 12; years-; /* end of if(months b)? a:b; max=(tempc)? temp:c; printf (n); printf ( 你輸入的數(shù)中最大的是%d.n,max

13、); 4.25 (1) 不嵌套的 if 語句#include void main() int x,y; printf(input x :); scanf(%d,&x); if ( x-5 & x0 & x=10 | x=-5) printf(errorn); (2) 嵌套的 if 語句#include void main() int x,y; printf(input x :); scanf(%d,&x); printf(n); if(x -5) printf(y is %d.n,y=x); else printf(error!n); if(0 = x) pri

14、ntf(y is %d.n,y=x-1); if(x 0) if(x -5 & x0 & x10 ) printf(y is %d.n,y=x+1); else printf(error!n); (4)switch語句#include void main() int x,y; printf(input x : ); scanf(%d,&x); switch (x) case -4: case -3: case -2: case -1: printf(y is %d.n,y=x); break; case 0: .printf(y is %d.n,y=x-1); brea

15、k; case 1: case 2: case 3: case 4: case 5: case 6: case 7: case 8: case 9: printf(y is %d.n,y=x+1); break; default: printf(error!n); 第五章 一. 選擇題5.1 d 5.2 c 5.3 b 5.4 c 5.5 c 5.6 b 5.7 d 5.8 a 5.9 d 5.10 d 二. 填空題5.11 5 4 6 5.12 死循環(huán)5.13 -1 5.14 11 5.15 d=1.0 k+ k=0 x 三. 編程題5.17 #include void main() int

16、 i; int sig = 1; int sum = 0; for(i=1; i=101; i+,i+) sum += sig*i; sig *= -1; printf(sum=%dn, sum); .5.18 (1) #include void main() int i; double m=1.0; double e = 1.0; for(i=1; i= 0.0004) m *= i; e += 1/m; i+; printf(e=%fn,e); 5.19 #include void main() int year; int col = 0; for(year=1600; year=2000

17、; year+) if(year%4 = 0 & year%100 != 0) | year%400 = 0) . printf(%dt, year); col+; if(col%5 = 0) printf(n); printf(n); 5.20 #include #define n 7 void main() int i; int j; int m; int k = n/2; for(i=0; i m = i-k; if(m 0) m *= -1; for(j=0; j printf( ); for(j=0; j= 0 & striloop = 9) num = 10*num

18、 + (striloop - 0); . iloop+; printf(%dn,num); 6.22 #include #include #define n 80 void main() char strn; int num = -1; do gets(str); num+; while(strcmp(str, eof); printf( 您輸入了 %d 行字符！ n,num); 6.23 #include #define n 80 void main() char strn; int iloop = 0; int num = 0; gets(str); while(striloop &

19、; iloop = a & striloop = z) num+; iloop+; printf( 您輸入了字符中有%d 個(gè)小寫字母！ n,num); .6.24 #include void main() int line; int iloop1; int iloop2; printf( 請(qǐng)輸入圖案的行數(shù)(不大于 26):); scanf(%d, &line); for(iloop1 = 0; iloop1 line; iloop1+) for(iloop2 = 0; iloop2 line - iloop1; iloop2+) printf( ); for(iloop2 =

20、0; iloop2 2*iloop1+1; iloop2+) printf(%c,iloop1 + a); printf(n); 第七章 一. 選擇題7.1 c 7.2 c 7.3 b 7.4 c 7.5 a 7.6 d 7.7 a 二. 填空題7.8 12 7.9 9.000000 7.10 4 7.11 n=1 s 7.12 =y z*x 7.13 1 s*i 0 f(k) 三. 程序調(diào)試和編程題7.14 fun(int n) int k,yes; for(k=2; k=n/2; k+) if(n%k = 0) yes = 0; break; .else yes = 1; return y

21、es; 7.15 int mymod(int a, int b) return a%b; 7.16 double fun(int n) double sum = 0; int iloop; int sig = -1; for(iloop=1; iloop=n; iloop+) sig *= -1; sum += sig*1.0/iloop; return sum; 7.17 double fun(int n) double t = 1.0; int iloop; long tmp; for(iloop=2; iloop=n; iloop+) tmp = iloop*iloop; t -= 1.

22、0/tmp; return t; 7.18 #include #include double fun(double x) return x*x + 5*x + 4; .void main() int x = 2; printf(y1=%fn, fun(x); printf(y2=%fn, fun(x+15); printf(y3=%fn, fun(sin(x); 第八章 一. 選擇題8.1 a 8.2 b 8.3 b 8.4 c 8.5 b 8.6 b 8.7 c 8.8 d 8.9 b 8.10 c 8.11 c 8.12 c 二. 填空題8.13 110 8.14 7 1 8.15 (1)

23、char *p=&ch; (2) p=&ch; (3)scanf(%c,p); (4)*p=a; (5)printf(%c,*p); 8.16 (1)s=p+3; (2)s=s-2 (3)50 (4)*(s+1) (5)2 (6)10 20 30 40 50 三. 編程題8.17 void fun(double x, double y, double *sum, double *div) *sum = x + y; *div = x - y; return; 8.18 void fun(double x, double y, double z, double *max, dou

24、ble *min) *max = x; *min = x; if(*max y) *max = y; if(*max y) *min = y; if(*min z) .*min = z; return; 第九章 一. 選擇題9.1 d 9.2 a 9.3 a 9.4 c 9.5 c 9.6 a 9.7 b 9.8 d 9.9 c 9.10 c 9.11 c 9.12 d 9.13 d 9.14 a 9.15 a 9.16 a 9.17 c 9.18 c 二. 填空題9.19 9 0 9.20 6 9.21 12 9.22 3 9.23 2721 9.24 -850,2,0 9.25 k=p k

25、 9.26 (c=getchar() c-a 三. 編程題9.27 #include #define n 81 int main() int counter10 = 0; int iloop = 0; char strn; gets(str); while(striloop) if(striloop = 0 & striloop = 9) counterstriloop - 0+; iloop+; for(iloop=0; iloop 10; iloop+) printf(%d - %dn, iloop, counteriloop); return 0; .9.28 void fun(

26、int array, int arraysize, int start) int iloop; if(start arraysize-1) if(start =0) start = 1; for(iloop = start; iloop arraysize; iloop+) arrayiloop-1 = arrayiloop; for(iloop = 0; iloop arraysize; iloop+) printf(no.%d = %dn, iloop, arrayiloop); 9.29 int fun(int arry1, int arry2, int arrysize) int il

27、oop; int counter = 0; for(iloop = 0; iloop arrysize; iloop+) if(arry1iloop % 2) arry2counter+ = arry1iloop; return counter; 9.30 void fun(char array, int arraysize) int iloop1; int iloop2; char temp; /* 冒泡排序*/ for(iloop1 = 0; iloop1 arraysize - 1; iloop1+) for(iloop2 = 0; iloop2 arraysize - 1 - iloo

28、p1; iloop2+) . if(arrayiloop2 arrayiloop2 + 1) temp = arrayiloop2; arrayiloop2 = arrayiloop2 + 1; arrayiloop2 + 1 = temp; 9.31 #include void fun(int array, int arraysize, int inertnumber) int iloop; int iloop2; if(array0 arrayarraysize-1) for(iloop = 0; iloop inertnumber) for(iloop2 = arraysize - 1;

29、 iloop2 = iloop; iloop2-) arrayiloop2 + 1 = arrayiloop2; arrayiloop = inertnumber; break; if(iloop = arraysize) arrayarraysize = inertnumber; else for(iloop = 0; iloop arraysize; iloop+) if(arrayiloop = iloop; iloop2-) .arrayiloop2 + 1 = arrayiloop2; arrayiloop = inertnumber; break; if(iloop = array

30、size) arrayarraysize = inertnumber; int main() int iloop; int a20 = 7,6,5,3,2,1; for(iloop = 0; iloop 6; iloop+) printf(%d , ailoop); printf(n); fun(a, 6, 0); for(iloop = 0; iloop 7; iloop+) printf(%d , ailoop); printf(n); fun(a, 7, 4); for(iloop = 0; iloop 8; iloop+) printf(%d , ailoop); printf(n);

31、 fun(a, 8, 8); for(iloop = 0; iloop 9; iloop+) printf(%d , ailoop); printf(n); return 0; 9.32 int fun(int number, int array) . int iloop = 0; int iloop2; int binlen; int midnumber; int div; int remain; midnumber = number; do div = midnumber/2; remain = midnumber%2; midnumber = div; arrayiloop+ = rem

32、ain; while(midnumber); binlen = iloop; for(iloop2 = 0, iloop = binlen - 1; iloop2 iloop; iloop2+, iloop-) midnumber = arrayiloop2; arrayiloop2 = arrayiloop; arrayiloop = midnumber; return binlen; 9.33 #include #include #define n 15 void fun(int array, int arraysize) int x; int iloop; int iloop2; for

33、(iloop = 0; iloop 0) x = rand()%20; iloop2 = 0; iloop2+; while(iloop2 iloop); arrayiloop = x; int main() int an; int iloop; fun(a, n); for(iloop = 0; iloop n; iloop+) printf(%dn, ailoop); return 0; 第十章 一. 選擇題10.1 c 10.2 b 10.3 c 10.4 b 10.5 c 10.6 a 10.7 c 10.8 a 10.9 c 10.10 c 二. 填空題10.11 gfedcb 10

34、.12 xyz 10.13 so 10.14 10 10.15 itis 10.16 strlen(str)-1 j- 10.17 3 10.18 goodgood ！三 . 編程題10.19 char* mygets(char *str) int iloop = 0; char ch; while(ch=getchar() != n) . striloop+ = ch; striloop = 0; return str; char * myputs(char *str) int iloop = 0; while(striloop) putchar(striloop+); putchar(n)

35、; return str; 10.20 #include #include int fun(char *str) int len; int iloop1; int iloop2; int result = 1; len = strlen(str); for(iloop1 = 0, iloop2 = len - 1; iloop1 len) return null; ch = strpos; for(iloop = pos; iloop len - 1; iloop+) striloop = striloop + 1; strlen-1 = 0; return ch; 第十一章 一. 選擇題11

36、.1 d 11.2 b 11.3 a 11.4 c 二. 填空題11.5 ijklefghabcd 11.6 7 11.7 8 11.8 *(s+j) i+1 i 11.9 17 11.10 (*fun)() (*fun)(a+i*h)/h mypoly 三. 編程題11.11 #include #include #define n 81 int main(int argc, char *argv) . char sig; int dig; int pos; char strn = 0; char outstrn = 0; if(argc 2) sig = -; dig = 10; else

37、sig = argv10; dig = argv11 - 0; printf( 請(qǐng)輸入一個(gè)字符串：); gets(str); if(sig = -) pos = strlen(str) - dig; if(pos dig) pos = dig; outstrpos = 0; printf( 處理后的字串為：); printf(%sn, outstr); .return 0; 11.12 #include #include void movebin(char *bin) int len; int iloop; len = strlen(bin); for(iloop = len; iloop 0

38、; iloop-) biniloop = biniloop - 1; return; void fun(int n, char *bin) int pos; pos = strlen(bin); if(n = 0) return; if(n = 1) movebin(bin); bin0 = 1; return; movebin(bin); bin0 = (n%2) + 0; n /= 2; fun(n, bin); return; int main() int a = 4; char bin50 = ; .fun(a, bin); printf(%sn, bin); return 0; 11

39、.13 #include long fun(int n) if(n = 1) return n; else return fun(n-1) + n; int main() int num; int sum; printf( 請(qǐng)輸入一個(gè)自然數(shù)：); scanf(%d, &num); sum = fun(num); printf( 結(jié)果是： %dn, sum); return 0; 11.14 #include int fun(int n) if(n = 0 | n = 1) return 1; else .return fun(n-1) + fun(n-2); int main() in

40、t num; int result; printf( 請(qǐng)輸入一個(gè)自然數(shù)：); scanf(%d, &num); result = fun(num); printf( 斐波拉契級(jí)數(shù)為：%dn, result); return 0; 第十二章 一. 選擇題12.1 b 12.2 b 12.3 a 12.4 c 12.5 d 12.6 b 12.7 a 12.8 a二. 填空題12.9 2,5,1,2,3,-2 12.10 2468 第十三章 一. 選擇題13.1 a 13.2 c 13.3 b 13.4 c 13.5 d 13.6 d 13.7 d 二. 填空題13.8 ar=9 ar=9

41、 ar=11 13.9 int* s *b 三. 編程題13.10 #define myalpha(c) (c=a & c=a & c=z) ? 1 : 0 13.11 #define swap(t,x,y) t tmp; tmp=x; x=y; y=tmp; 13.12 #include #include int main() int *p; int tmp; int iloop; .int iloop2; p = (int *)malloc(sizeof(int)*3); scanf(%d%d%d, p,p+1,p+2); for(iloop = 0; iloop 2; i

42、loop+) for(iloop2 = 0; iloop2 *(p + iloop2 + 1) tmp = *(p + iloop2); *(p + iloop2) = *(p + iloop2 + 1); *(p + iloop2 + 1) = tmp; printf(%d %d %dn, *p, *(p+1), *(p+2); free(p); p = null; return 0; 第十四章 一. 選擇題14.1 d 14.2 d 14.3 d 14.4 a 14.5 c 14.6 c 14.7 c 14.8 b 二. 填空題14.9 struct link *next 14.10 p-

43、next mp-data 14.11 (struct list*) struct list struct list* struct list return h 三. 編程題14.12 #include #define n 3 struct stud char num5, name10; int s4; double ave; ; .void readrec(struct stud array, int size) int iloop; for(iloop=0; iloop scanf(%s%s%d%d%d%d, arrayiloop.num, arrayil, &arr

44、ayiloop.s0, &arrayiloop.s1, &arrayiloop.s2, &arrayiloop.s3); arrayiloop.ave = (arrayiloop.s0 + arrayiloop.s1 + arrayiloop.s2 + arrayiloop.s3)/4.0; return; void writerec(struct stud array, int size) int iloop; for(iloop=0; iloop printf(%st%st%dt%dt%dt%dt%fn, arrayiloop.num,arrayil

45、,arrayiloop.s0, arrayiloop.s1,arrayiloop.s2,arrayiloop.s3, arrayiloop.ave); return; int main() struct stud stun; readrec(stu, n); writerec(stu, n); return 0; 14.13 #include #include #define n 100 struct node int data; .struct node* next; ; int seekmaxvalue(struct node *pnode) int max; struct node* p

46、move; pmove = pnode; max = pmove-data; pmove = pmove-next; while(pmove) if(max data) max = pmove-data; pmove = pmove-next; return max; struct node* seekmaxvalueaddress(struct node *pnode) int max; struct node* maxaddress; struct node* pmove; pmove = pnode; max = pmove-data; maxaddress = pmove; pmove

47、 = pmove-next; while(pmove) if(max data) max = pmove-data; maxaddress = pmove; pmove = pmove-next; return maxaddress; .int main() struct node* head; struct node* pnode; int iloop; head = (struct node*)malloc(sizeof(struct node); pnode = head; pnode-next = null; for(iloop=0; iloop pnode-next = (struct node*)malloc(sizeof(struct node); pnode = pnode-next; pnode-next = null; pnode-data = iloop; printf(%dn, seekmaxvalue(head-next); printf(%dn, seekmaxvalueaddress(head-next)