A、see
B、saw
C、I have ever seen
D、seen
第1题:
—Which subject do you like______?
—I like chemistry than any other one.
A. better, better
B. best, better
C. best, best
D. better, best
第2题:
A、worse
B、well
C、good
D、best
第3题:
9.Which do you like _________ ,Beijing _________ Shanghai?
A. better,or
B. best,or
C. better,and
D. best,and
第4题:
Best________(祝愿) for Children's Day.
第5题:
最短路径
A.标号法求解单源点最短路径:
var
a:array[1..maxn,1..maxn] of integer;
b:array[1..maxn] of integer; {b[i]指顶点i到源点的最短路径}
mark:array[1..maxn] of boolean;
procedure bhf;
var
best,best_j:integer;
begin
fillchar(mark,sizeof(mark),false);
mark[1]:=true; b[1]:=0;{1为源点}
repeat
best:=0;
for i:=1 to n do
If mark[i] then {对每一个已计算出最短路径的点}
for j:=1 to n do
if (not mark[j]) and (a[i,j]>0) then
if (best=0) or (b[i]+a[i,j]<best) then begin
best:=b[i]+a[i,j]; best_j:=j;
end;
if best>0 then begin
b[best_j]:=best;mark[best_j]:=true;
end;
until best=0;
end;{bhf}
第6题:
Nyloncameoutoffiveyearslaterthan.
A.radio
B.camera
C.jetplanes
D.movies
第7题:
下面程序输出的结果是( )。 #include<iostream> using namespace std; void main() { char ch[][8]={"good","better","best"}; for(int i=1;i<3;++i) { cout<<ch[i]<<endl; } }
A.good better
B.better best
C.good best
D.good
第8题:
12.
A.more
B.most
C.better
D.best
第9题:
A.CoS0=Best-EffortData
B.CoS1=Best-EffortData
C.CoS3=HighPriority
D.CoS4=HighPriorityData
E.CoS5=VoiceBearer
F.CoS7=VoiceBearer
第10题:
20.
A. worse
B. worst
C. better
D. best