c语言国二题库题目加答案,国家计算机2级(c语言)机试题库一

国家计算机2级(c语言)机试题库一

11套 每一套题目都是按照“填空题--改错题---编程题”顺序排列,填空题上面带有两个划线的是人工做题时候多余划线，不要理睬！！#include #include #define N 10double fun(double *x){ int i, j; double av, y[N];av=0;/**********found**********/for(i=0; ivoid fun ( char *s, int num[5] ){ int k, i=5;for ( k = 0; k= 0)num[i]++;}}main( ){ char s1[81]; int num1[5], i;printf( “\nPlease enter a string: “ ); gets( s1 );fun ( s1, num1 );for ( i=0; i 3#define M 4#define N 5int fun ( int a[M][N] ){int tot=0,i,j;for(i=0;i#define N 4/**********found**********/void fun(int ___t[][N]___ , int n){ int i,s;/**********found**********/for(i=0; i #define N 10/************found************/int fun(int a[], int m ){ int low=0,high=N-1,mid;while(low a[mid])low=mid+1;else return(mid);}return(-1);}main(){ int i,a[N]={-3,4,7,9,13,45,67,89,100,180 },k,m;printf(“a数组中的数据如下:“);for(i=0;i=0) printf(“m=%d,index=%d\n“,m,k);else printf(“Not be found!\n“);}编程题6#include void fun( char *a, char *p ){char *q=a;int j=0;while(*q struct aa *next; }NODE;int fun(NODE *h) { int sum = 0 ;NODE *p;/***********found**********/p=h->next;while(p){ if(p->data%2==0)sum +=p->data;/***********found**********/p=p->next;}return sum;}NODE *creatlink(int n){ NODE *h, *p, *s;int i;h=p=(NODE *)malloc(sizeof(NODE));for(i=1; idata=rand()%16;s->next=p->next;p->next=s;p=p->next;8}p->next=NULL;return h;}outlink(NODE *h, FILE *pf){ NODE *p;p = h->next;fprintf(pf ,“\n\nTHE LIST :\n\n HEAD “ );while(p){ fprintf(pf ,“->%d “,p->data ); p=p->next; }fprintf (pf,“\n“);}outresult(int s, FILE *pf){ fprintf(pf,“\nThe sum of even numbers : %d\n“,s);}main(){ NODE *head; int even;head=creatlink(12);head->data=9000;outlink(head , stdout);even=fun(head);printf(“\nThe result :\n“); outresult(even, stdout);}编程题#include #include #define N 80int fun(char *str){int i,j = strlen(str);for(i=0;i#include #define N 6typedef struct node {int data;struct node *next;} NODE;void fun(NODE *h){ NODE *p, *q; int t;p = h;while (p) {/**********found**********/q = __p->next__ ;/**********found**********/while (__q __)10{ if (p->data > q->data){ t = p->data; p->data = q->data; q->data = t; }q = q->next;}/**********found**********/p = __ p->next __ ;}}NODE *creatlist(int a[]){ NODE *h,*p,*q; int i;h=NULL;for(i=0; idata=a[i];q->next = NULL;if (h == NULL) h = p = q;else { p->next = q; p = q; }}return h;}void outlist(NODE *h){ NODE *p;p=h;if (p==NULL) printf(“The list is NULL!\n“);else{ printf(“\nHead “);do{ printf(“->%d“, p->data); p=p->next; }while(p!=NULL);printf(“->End\n“);}}main(){ NODE *head;int a[N]= {0, 10, 4, 2, 8, 6 };head=creatlist(a);printf(“\nThe original list:\n“);outlist(head);fun(head);printf(“\nThe list after inverting :\n“);outlist(head);}改错题