网友您好, 请在下方输入框内输入要搜索的题目:

题目内容 (请给出正确答案)

10. The next morning I found everything _______with snow,

A. cover

B. was covered

C. be covered

D. covering


参考答案

更多 “ 10. The next morning I found everything _______with snow,A. coverB. was coveredC. be coveredD. covering ” 相关考题
考题 —Can I help you?—I’d like to buy a present for my mother’s birthday, () at a proper price but of great use. A、oneB、thatC、anyoneD、everything

考题 下面程序的输出结果为【】。 include main() { char a[]="morning",t; int i,j=0; for( 下面程序的输出结果为【 】。include<iostream.h>main(){char a[]="morning",t;int i,j=0;for(i=1;i<7;i++)if(a[j]<a[i])j=i;t=a[j];a[j]=a[7];a[7]=a[j];cout<<a;}

考题 使用VC6打开考生文件夹下的工程test30_1,此工程包含一个源程序文件test30_1.cpp,但该程序运行有问题,请改正程序中的错误,使该程序的输出结果为:Previous=9,Next=11源程序文件test30_1.cpp清单如下:include <iostream.h>/***************** found *****************/void prevnext (int,int ,int);int main ( ){int x=10,y,z;prevnext (x,y,z);cout << "Previous=" << y << ", Next=" << z<<end1;return 0;}/***************** found *****************/void prevnext (int x, int prev, int next){/***************** found *****************/prev=x--;next=++x;}

考题 下面程序的运行结果是includemain(){char a[]="morning",t; int i,j=0; for(i=1;i 下面程序的运行结果是 #include<stdio.h> main() { char a[]="morning",t; int i,j=0; for(i=1;i<7;i++) if(a[j]<a[i])j=i; t=a[j]; a[j]=a[7]; a[7]=a[j]; puts[a];}A.mrgninrB.moC.moringD.morning

考题 执行下列语句后指针及链表的示意图为(43)。L = (LinkList) malloc ( sizeof (LNode) );P = L;for(i =0;i <=3;i ++) {P→next = (LinkList) malloc (sizeof (LNode));P = P→next;P→data = i * i + 1;}A.B.C.D.

考题 下列给定程序中,是建立一个带头结点的单向链表,并用随机函数为各结点数据域赋值。函数fun的作用是求出单向链表结点(不包括头结点)数据域中的最大值,并且作为函数值返回。请改正程序指定部位的错误,使它能得到正确结果。[注意] 不要改动main函数,不得增行或删行,也不得更改程序的结构。[试题源程序]include<stdio.h>include<stdlib.h>typedef struct aa{int data;struct aa *next;}NODE;fun(NODE *h){int max=-1;NODE *p;/***********found************/p=h;while(p){if(p->data>max)max=p->data;/************found************/p=h->next;}return max;}outresult(int s, FILE *Pf){fprintf(pf, "\nThe max in link: %d\n", s);}NODE *creatlink(int n, int m){NODE *h, *p, *s, *q;int i, x;h=p=(NODE *)malloc(sizeof(NODE));h->data=9999;for(i=1; i<=n; i++){s=(NODE *)malloc(sizeof(NODE));s->data=rand()%m; s->next=p->next;p->next=s; p=p->next;}p->next=NULL;return h;}outlink(NODE *h, FILE *pf){NODE *p;p=h->next;fprintf(Pf, "\nTHE LIST:\n\n HEAD");while(P){fprintf(pf, "->%d", P->datA); p=p->next;}fprintf(pf, "\n");}main(){NODE *head; int m;head=cteatlink(12,100);outlink(head, stdout);m=fun(head);printf("\nTHE RESULT"\n");outresult(m, stdout);}

考题 ●试题二阅读下列函数说明和C代码,将应填入(n)处的字句写在答题纸的对应栏内。【说明】该程序运行后,输出下面的数字金字塔【程序】includestdio.hmain (){char max,next;int i;for(max=′1′;max=′9′;max++){for(i=1;i=20- (1) ;++i)printf(" ");for(next= (2) ;next= (3) ;next++)printf("%c",next);for(next= (4) ;next= (5) ;next--)printf("%c",next);printf("\n");}}

考题 在KMP模式匹配中,用next数组存放模式串的部分匹配信息。当模式串位j与目标串位i比较时,两字符不相等,则i的位移方式是()。A.i=next[j]B.i不变C..j不变D.j=next[j]

考题 L1是不带头结点的单链表。以下算法功能是什么? Status fun(LinkList L1, LinkList L2) {p=L1; n=0; while(p){n++; p=p->next;} p=L1; for(i=1;i<n/2;i++)p=p->next; L2=p->next; p->next=NULL; return OK; }

考题 【单选题】10.在循环双链表的p所指结点之后插入s所指结点的操作是()。A.p->next=s; s->prior=p; p->next->prior=s; s->next=p->next;B.p->next=s; p->next->prior=s; s->prior=p; s->next=p->next;C.s->prior=p; s->next=p->next; p->next=s; p->next->prior=s;D.s->prior=p; s->next=p->next; p->next->prior=s; p->next =s;