(完整版)全国计算机等级考试二级教程--C语言程序设计课后习题答案

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.0/tmp; } return t; } 7.18 #include #include

double fun(double x) {

return x*x + 5*x + 4; }

void main() { int x = 2;

printf(\ printf(\ printf(\ } 第八章 一. 选择题

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)char *p=&ch; (2) p=&ch; (3)scanf(\ 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, double *min) {

*max = x; *min = x; if(*max < y) {

*max = y; }

if(*max < z) {

*max = z; }

if(*min > 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

9.26 (c=getchar()) c-'A'

三. 编程题 9.27 #include #define N 81 int main() {

int counter[10] = {0}; int iLoop = 0; char str[N];

gets(str); while(str[iLoop]) {

if(str[iLoop] >= '0' && str[iLoop] <= '9') {

counter[str[iLoop] - '0']++; } iLoop++; }

for(iLoop=0; iLoop < 10; iLoop++) {

printf(\ } return 0; } 9.28

void fun(int array[], int arraysize, int start) { int iLoop;

if(start < arraysize-1) {

if(start <=0) { start = 1; }

for(iLoop = start; iLoop < arraysize; iLoop++) {

array[iLoop-1] = array[iLoop]; } }

for(iLoop = 0; iLoop < arraysize; iLoop++) {

printf(\ } } 9.29

int fun(int arry1[], int arry2[], int arrysize) { int iLoop; int counter = 0;

for(iLoop = 0; iLoop < arrysize; iLoop++) {

if(arry1[iLoop] % 2) {

arry2[counter++] = arry1[iLoop]; } }

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 - iLoop1; iLoop2++) {

if(array[iLoop2] < array[iLoop2 + 1]) {

temp = array[iLoop2];

array[iLoop2] = array[iLoop2 + 1]; array[iLoop2 + 1] = temp; } } } }