- 1、本文档共6页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
福建工程学院《计算机专业英语》答案1-10
《计算机专业英语》参考答案
Chapter 1 Computer Science
Text A
Exercises
2.(a)out (b)with (c)in (d)in (e)in (f)with (g)for (h)about
Text B
Exercises
3.(a)to (b)now (c)in (d)with (e)out (f)upon
Text C
Exercises
1.(1)analyze, analytic (2)complicate, complex (3) collaborate, collaborative (4)vary, various (5)introduce, introductory (6)base, basic (7)create, creative (8)differ, different (9)free, free
Chapter 2 Discrete Mathematics for Computer Science
Text A
Exercises
C48 =70,C38 =56
6*25=192
if a=0
then if b=0
then return(0)
else return(1+Add(0,b-1))
else if b=0
then return(1+Add(a-1,0))
else return(1+1+Add(a-1,b-1))
if Rest(S)= ?
then return(First(S))
else if (First(S)Largest(Rest(S)))
return(Largest(Rest(S)))
else Return(First(S))
Now we can define function Concat(S1,S2) as:
if(Length(S1)=0)
then return(S2)
else return(Cons(First(S1), Concat(Rest(S1),S2)))
Text B
Exercises
1.[Proof]:According to given conditions, we know
an = an-1 + 2n
an-1 = an-2 + 2(n-1)
……
a2 = a1 + 2*2
a1 = 3
sum all items in left side, and delete same items in the right side of equations, we can result that
an = 3 + 2(2+3+……+n-1+n)=1+n(n+1)=n2+n+1
that is what we conclude.
Text C
Exercises
1.(1)depend, dependent (2) correspond, correspondent (3)grow, grown (4)solve, solvent (5) relate, relational (6)recur, recursive (7) validate, valid (8) conclude, conclusive (9) justify, justificative
2.(1)connect-disconnect (2)possible-impossible (3)regular-irregular (4)measure-countermeasure
Chapter 3 Algorithms in the Real World
Text A
Exercises
2. finite, solving, processing, effective, eventually, next, randomly
3. by, in, on, in, on, from
4. the algorithm can terminate.
It is correct for sorting.
If the length of array A is n, the time for computation is O(n2)
Its memory cost n units.
As n increase, its computational cost will become large.
Text B
Exercises
3.(1)—(e), (2)—(c), (3)—(d), (4)—(a), (5)—(b)
4. inconvenience, incapacity, independence
5.We couldn’t have lived without water.
Chapte
文档评论(0)