早教吧作业答案频道 -->英语-->
SAT2006.5真题语法问题1.Thecandidatecalledformedicalinsurancereform,buttomeheseemedlessinterestedintheplightoftheuninsuredcitizensthaninwhetherenoughisregisteredtovote.enoughis怎么改啊?2.Becausehisexperiencein
题目详情
SAT2006.5真题语法问题
1.The candidate called for medical insurance reform,but to me he seemed less interested in the plight of the uninsured citizens than in whether enough is registered to vote.
enough is怎么改啊?
2.Because his experience in the naval medical corps had been rewarding,Bob applied to medical school after he was discharged from the navy
rewarding为什么是对的
3.Africa's Kanem empire,after enduring for over a thousand years,is believed to have fallen into decline when trade centers shift outside its boundaries.
shift有什么问题啊?
1.The candidate called for medical insurance reform,but to me he seemed less interested in the plight of the uninsured citizens than in whether enough is registered to vote.
enough is怎么改啊?
2.Because his experience in the naval medical corps had been rewarding,Bob applied to medical school after he was discharged from the navy
rewarding为什么是对的
3.Africa's Kanem empire,after enduring for over a thousand years,is believed to have fallen into decline when trade centers shift outside its boundaries.
shift有什么问题啊?
▼优质解答
答案和解析
1.enough这里指的是前面的citizens,所以谓语用复数.改成enough are
2.rewarding本身是一个形容词:有利可图的,有奖赏的
3.shift的时态错误,应为shifted 当贸易中心转移到国外的时候,显然是过去时.
-----------------
新航道SAT培训,祝你取得优异成绩
2.rewarding本身是一个形容词:有利可图的,有奖赏的
3.shift的时态错误,应为shifted 当贸易中心转移到国外的时候,显然是过去时.
-----------------
新航道SAT培训,祝你取得优异成绩
看了 SAT2006.5真题语法问...的网友还看了以下:
关于随机变量的问题设随机变量X~N(2,O^2),且P{2 2020-05-20 …
Performanceevaluation...o(1),O(n),O(n?2),O(logn)? 2020-06-03 …
sin0的导数是先求导变cos还是先算sin0=0如果是先算sin0=0再求导的话为什么泰勒公式中 2020-06-10 …
谁帮我做下下面的关于时间复杂度的习题?f(n)=100n^3+n^2+1000,g(n)=25n^ 2020-06-12 …
若某共价化合物分子中只含有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 …
关于数列的问题较难请高手指教...已知函数f(n)=log(n+1)(底数)(n+2)(真数),n 2020-07-30 …
一个有关大O(阶)的问题求两个单调递增函数f(n)和g(n)(n为自然数),f(n)≠O(g(n) 2020-07-31 …
设算法的计算时间可用递推关系式T(n)=2T(n/2)+n表示,则该算法的时间复杂度为()A:O( 2020-08-01 …
关于渐进时间复杂度题已知某一算法的时间复杂度上限函数满足递归关系T(n)=2(T/2)+n,那么该算 2021-01-14 …