niusouti.com
The underlined word remedy in Paragraph 1 is closest in meaning to __________.A. avoidB. acceptC. improveD. consider
题目
The underlined word remedy in Paragraph 1 is closest in meaning to __________.
A. avoid
B. accept
C. improve
D. consider
相似考题
参考答案和解析
由第一段最后两句可知
更多“The underlined word remedy in Paragraph 1 is closest in meaning to __________.A. avoid ”相关问题
-
第1题：
He could not ________ the feeling that someone was watching him.A. see
B. saw
C. avoided
D. avoid
参考答案：D
-
第2题：
Every vessel which is directed by these Rules to keep out of the way of another vessel shall, if the circumstances of the case admit, avoid ______.
A.crossing ahead of the other
B.crossing astern of the other
C.passing port to port
D.passing starboard to starboard
正确答案：A
假如环境许可，被规则要求应给他船让路的每一艘船舶应避免穿越他船船艏。 -
第3题：
If we leave now,we should miss the traffic.A:direct
B:stop
C:mix
D:avoid答案：D解析：如果现在出发就能避免交通高峰。miss：错过；direct：指挥；stop：停止；mix：混合；avoid: 避免，最符合题意。 -
第4题：
最小生成树
A.Prim算法：
procedure prim(v0:integer);
var
lowcost,closest:array[1..maxn] of integer;
i,j,k,min:integer;
正确答案：begin
for i:=1 to n do begin
lowcost[i]:=cost[v0,i];
closest[i]:=v0;
end;
for i:=1 to n-1 do begin
{寻找离生成树最近的未加入顶点k}
min:=maxlongint;
for j:=1 to n do
if (lowcost[j]<min) and (lowcost[j]<>0) then begin
min:=lowcost[j];
k:=j;
end;
lowcost[k]:=0; {将顶点k加入生成树}
{生成树中增加一条新的边k到closest[k]}
{修正各点的lowcost和closest值}
for j:=1 to n do
if cost[k,j]<lwocost[j] then begin
lowcost[j]:=cost[k,j];
closest[j]:=k;
end;
end;
end;{prim} -
第5题：
If we leave now,we should miss the traffic.A:direct
B:mix
C:stop
D:avoid答案：D解析：这句话的意思是：如果我们现在出发，就能避开来往的车辆和行人。句中“miss”意为 “避开”。四个选项中A项意为“指导，指挥”;B项意为“混合”;C项意为“停止”;D项意为“避开，逃避”。因此只有D项最为合适。 -
第6题：
Rodman met with Tony to try and settle the dispute over their contract.A:mark
B:involve
C:solve
D:avoid答案：C解析：本句意思：罗德曼与托尼会面，尝试解决他们的合同纠纷。settle意为“解决”。四个选 项中，意思为“解决”的选项是solve。另外，be involved in意为“卷人……”。