50.
(A)p->next
(B)p
(C)s
(D)s->next

46.有以下程序  mina()  { int x[]={1,3,5,7,2,4,6,0},i,j,k;  for(i=0;i=i;j--)  if(x[j+1]>x[j]){ k=x[j];x[j]=x[j+1];x[j+1]=k;}  for(i=0;i

47.有如下程序  #include  main()  {FILE *fp1;  fp1=fopen("f1.txt","w");  fprintf(fp1,"abc");  fclose(fp1);  }  若文本文件f1.txt中原有内容为：good，则运行以上程序后文件f1.txt中的内容为  (A)goodabc (B)abcd (C)abc (D)abcgood

48.48~50.以下程序的功能是：建立一个带有头结点的单向链表，并将存储在数组中的  字符依次转储到链表的各个结点中，请从与下划线处号码对应的一组选若中选择出  正确的选项。  #include  stuct node  { char data; struct node *next;};  (48) CreatList(char *s)  { struct node *h,*p,*q);  h=(struct node *) malloc(sizeof(struct node));  p=q=h;  while(*s!='\0')  { p=(struct node *) malloc(sizeof(struct node));  p->data= (49) ;  q->next=p;  q= (50) ;  s++;  }  p->next='\0';  return h;  }  main()  { char str[]="link list";  struct node *head;  head=CreatList(str);  ...  } (A)char * (B)struct node (C) struct node* (D) char

49.(A)*s (B)s (C)*s++ (D)(*s)++

21. –Bruce, I really appreciate your handwriting. -- . (A) I practice every day (B) Thank you very much (C) No, I don’t think so (D) Well, it’s not good enough

22. --Why does the Lake smell terrible? --Because large quantities of water . (A) have polluted (B) is being polluted (C) has been polluted (D) have been polluted

23. --How amazing it is that astronauts are exploring outer space! --It’s a challenge, I guess, man against nature. (A) of (B) for (C) by (D) about

24. It’s helpful to put children in a situation they can see themselves differently. (A) that (B) when (C) which (D) where

25. For a moment nothing happened ,Then all shouting together. (A) voices had come (B) came voices (C) voices would come (D) did voices come

26. --Your mum is very kind --Yeah, My mum is pretty considerate, you know what ,she always arranges everything around me. (A) she means (B) you mean (C) I mean (D) we mean