早教吧作业答案频道 -->英语-->
1.Fewpeoplecouldhaveguessed,asthey(A.watch)Annawinthetennismatchwith(B.apparent)ease,(C.howpessimistic)shehadbeenaboutherchances(D.ofbeating)heropponent.E.Noerror错选D.2.Theaquaticweedcalled"giantsalvinia"whichgro
题目详情
1.Few people could have guessed,as they (A .watch) Anna win the tennis match with (B.apparent) ease,(C.how pessimistic) she had been about her chances (D.of beating ) her opponent.
E.No error 错选D.
2.The aquatic weed called "giant salvinia"which grows far (A.more repidly than) do (B.plants native) to the lakes it (C.infests),(D.threaten) many freshwater ecosystem.E,No error 错选A.
E.No error 错选D.
2.The aquatic weed called "giant salvinia"which grows far (A.more repidly than) do (B.plants native) to the lakes it (C.infests),(D.threaten) many freshwater ecosystem.E,No error 错选A.
▼优质解答
答案和解析
第一题是 明显的时态错误.as引导的是时间状语从句,插入进了主句的谓语和宾语之间,常规顺序是Few people could have guessed (C.how pessimistic) she had been about her chances (D.of beating ) her opponent,as they (A .watch) Anna win the tennis match with (B.apparent) ease.
主句谓语和改宾语从句谓语已经用了过去式could have guessed和she had been about,所以要将从句的谓语watch改成watched
第二题并不是楼上所说的缺谓语.而是谓语动词应该用第三人称单数.这个句子的主语是The aquatic weed ,called "giant salvinia" 是The aquatic weed的定语,后面which是定语从句修饰giant salvinia",句子的谓语是threaten,后面many freshwater ecosystem是threaten的宾语.鱿鱼主语是The aquatic weed所以谓语动词threaten要改成threatens
主句谓语和改宾语从句谓语已经用了过去式could have guessed和she had been about,所以要将从句的谓语watch改成watched
第二题并不是楼上所说的缺谓语.而是谓语动词应该用第三人称单数.这个句子的主语是The aquatic weed ,called "giant salvinia" 是The aquatic weed的定语,后面which是定语从句修饰giant salvinia",句子的谓语是threaten,后面many freshwater ecosystem是threaten的宾语.鱿鱼主语是The aquatic weed所以谓语动词threaten要改成threatens
看了1.Fewpeoplecoul...的网友还看了以下:
用所给字母拼成单词.1.a,l,a,d,s.2.a,d,o,s.3.c,o,r,p,n用所给字母拼 2020-05-15 …
A.O(1),O(1)B.O(n),O(1)C.O(n2),O(1)D.O(n),O(n) 2020-05-26 …
若某共价化合物分子中只含有C、H、O、N四种元素,且以n(C)、n(N)、n(O)分别表示C、N、 2020-07-20 …
求给以下算法复杂度排序增长速度由慢到快1)O(n^(3/4))O(log(n)^5)O(2^n)O 2020-07-23 …
设算法的计算时间可用递推关系式T(n)=2T(n/2)+n表示,则该算法的时间复杂度为()A:O( 2020-08-01 …
数据结构的问题6.程序段For(i=n-1;i>0;i--)For(j=1;ja[j+1])a[j] 2020-10-30 …
程序段for(i=n-1;i>=0;i--)for(j=1;jA[j+1]A[j]与A[j+1]对换 2020-11-26 …
已知两个长度分别为m和n的升序链表若将它们合并为一个长度为m+n的降序链表,则最坏情况下的时间复杂度 2020-11-28 …
下列四种算法的时间复杂度中,执行时间最短.A.O(n)B.O(log2n)C.O(2n)D.O(n2 2020-12-15 …
3.下面算法的时间复杂度为?3.下面算法的时间复杂度为。intf(unsignedintn){if( 2021-01-14 …