早教吧作业答案频道 -->英语-->
一个英文句子求解AcousinofthetenaciousAsianlonghornedbeetle—whichsinceitsinitialdiscoveryin1996inNewYourkCityhascausedtensofmillionsofdollarsindamageannually—thecitruslonghornedbeetlewasdiscoveredonajunip
题目详情
一个英文句子求解
A cousin of the tenacious Asian longhorned beetle—which since its initial discovery in 1996 in New Yourk City has caused tens of millions of dollars in damage annually—the citrus longhorned beetle was discovered on a juniper bush in August 2001 in Tukwila,Washington.
求好心人回答一下.
"which since its initial discovery in.in damage annually"这一整句话是修饰Asian longhorned beetle,还是修饰citrus longhorned beetle(也就是Asian longhorned beetle的cousin),为什么.
感激不尽!
A cousin of the tenacious Asian longhorned beetle—which since its initial discovery in 1996 in New Yourk City has caused tens of millions of dollars in damage annually—the citrus longhorned beetle was discovered on a juniper bush in August 2001 in Tukwila,Washington.
求好心人回答一下.
"which since its initial discovery in.in damage annually"这一整句话是修饰Asian longhorned beetle,还是修饰citrus longhorned beetle(也就是Asian longhorned beetle的cousin),为什么.
感激不尽!
▼优质解答
答案和解析
是修饰Asian longhorned beetle 的.因为后面一句话 the citrus longhorned beetle was discovered on a juniper bush in August 2001 in Tukwila,Washington.说了citrus longhorned beetle是在2001年发现的,所以 which since its initial discovery in 1996 in New Yourk City has caused tens of millions of dollars in damage annually 这句话是修饰Asian longhored beetle 的因为它说discovery in 1996,在1996年发现的.citrus longhored beetle 不可能又在2001年发现又在1996年发现~
看了 一个英文句子求解Acousi...的网友还看了以下:
设平衡二叉排序树(AVL树)的节点个数为n,则其平均检索长度为A.O(1)B.O(log2n)C.O 2020-05-23 …
对n个记录的文件进行堆排序,最坏情况下的执行时间为A.O(log2n)B.O(n)C.O(n log 2020-05-23 …
对n个元素进行堆排序时,其空间复杂度为()。A.O(log2n)B.O(n log2n)C.O(n) 2020-05-24 …
设平衡的二叉排序树(AVL树)的结点个数为n,则其平均检索长度为A.O(1)B.O(log2n)C. 2020-05-24 …
设平衡的二叉排序树(AVL树)的结点个数为n,则其平均检索长度为()。A.O(1)B.O(log2n 2020-05-24 …
(接上一题)则时间和空间复杂度分别为(63)。A.O(n2)和O(n)B.O(nlgn)和O(n)C 2020-05-26 …
A.O(n2)B.O(n)C.O(n-1)D.O(n+1) 2020-05-26 …
T1:=C>O;T2:=REF(COUNT(O>C,N)=N,1);T3:=REF(C>O,N+1 2020-07-23 …
设算法的计算时间可用递推关系式T(n)=2T(n/2)+n表示,则该算法的时间复杂度为()A:O( 2020-08-01 …
数据结构试题一、单项选择题(10)1、若长度为n的线性表采用顺序存储结构,在其第i个位置插入一个新元 2021-01-14 …