网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
My father is fast ( ), so I don’t want to wake him up.
A、sleepy
B、sleeping
C、sleep
D、asleep
参考答案
更多 “ My father is fast ( ), so I don’t want to wake him up. A、sleepyB、sleepingC、sleepD、asleep ” 相关考题
考题
—Mark speaks English well, but you??____________ him.—Thank you. .A. speak as badly as B. speak worse thanC. don’t speak so badly as D. speak much better than
考题
阅读下列函数说明和C函数，将应填入(n)处的字句写在对应栏内。[说明]Kruskal算法是一种构造图的最小生成树的方法。设G为一无向连通图，令T是由G的顶点构成的于图，Kmskal算法的基本思想是为T添加适当的边使之成为最小生成树：初始时，T中的点互相不连通；考察G的边集E中的每条边，若它的两个顶点在T中不连通，则将此边添加到T中，同时合并其两顶点所在的连通分量，如此下去，当添加了n-1条边时，T的连通分量个数为1，T便是G的一棵最小生成树。下面的函数void Kruskal(EdgeType edges[],int n)利用Kruskal算法，构造了有n个顶点的图 edges的最小生成树。其中数组father[]用于记录T中顶点的连通性质：其初值为father[i]=-1 (i=0,1,…,n-1)，表示各个顶点在不同的连通分量上；若有father[i]=j，j＞-1，则顶点i，j连通；函数int Find(int father[],int v)用于返回顶点v所在树形连通分支的根结点。[函数]define MAXEDGE 1000typedef struct{ int v1;int v2;}EdgeType;void Kruskal(EdgeType edges[],int n){ int father[MAXEDGE];int i,j,vf1,vt2;for(i=0;i＜n;i+ +) father[i]=-1;i=0;j=0;while(i＜MAXEDGE j＜(1)){ vf1=Find(father,edges[i].v1);vf2=Find(father,edges[i].v2);if((2)){(3)=vf1;(4);printf("%3d%3d\n",edges[i].v1,edges[i].v2);}(5);}}int Find(int father[],int v){ int t;t=v;while(father[t]＞=0) t=father[t];return(t);}
考题
Saul's brother left the matter entirely up to ______ and ______.A. I, heB. him, IC. me, heD. him, me
考题
Mother: Walter! Don't make any sound when you have your soup.Walter: Yes, Mum.Father: ________. He's only a child.A、I completely agree with youB、Don't be so hard on himC、The noise is very disturbingD、Don't be very cruel to him
考题
I’dratheryou________makeanycommentontheissueforthetimebeing.A)don’tB)wouldn’tC)didn’tD)shouldn’t
考题
-- Ann is in hospital.-- Oh, really? I __ know. I __ go and visit her.A. didn’t; am going to B. don’t; wouldC. don’t; will D. didn't; will
热门标签
最新试卷