数据结构自测题(data structure self test questions )

数据结构自测题(data structure self test questions )

ID:13583702

大小:43.50 KB

页数:21页

时间:2018-07-23

数据结构自测题(data structure self test questions )_第1页
数据结构自测题(data structure self test questions )_第2页
数据结构自测题(data structure self test questions )_第3页
数据结构自测题(data structure self test questions )_第4页
数据结构自测题(data structure self test questions )_第5页
资源描述:

《数据结构自测题(data structure self test questions )》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、数据结构自测题(2)(Datastructureselftestquestions(2))ThefirstchapterisintroductionFirst,themultiple-choicequestionThesizeofthecomputationofthe1.algorithmiscalledcomputational.BeijingUniversityofPostsandTelecommunications,2000,two,3(20/8)A.efficiencyB.complexity,C.,realityD.difficultyT

2、hetimecomplexityofthe2.algorithmdependson(1998)Two,1(2points)ThescaleoftheA.problemB.initialdatatobeprocessedC.,A,andB3.computeralgorithmsreferto(1)thatitmusthave(2)thesethreecharacteristics.(1)A.calculationmethod,B.sortingmethod,C.,thesequenceofstepstosolvetheproblemD.schedul

3、ingmethod(2)A.isexecutable,portable,extensible,B.executable,deterministic,andpoorC.isdeterministic,poor,andstableD.readability,stability,securityNanjingUniversityofScienceandTechnology,1999,1(2points)(WuhanTransportationUniversityofscienceandtechnology,1996)One,1(4points)4.,an

4、algorithmshouldbe().[ZhongshanUniversity1998,two,1(2points)]A.procedureB.descriptionofproblemsolvingstepsC.meetsfivebasicfeatures,D.AandC.5.,thefollowingaboutalgorithmerroris()[NanjingUniversityofScienceandTechnology,2000,a,1(1.5points)]TheA.algorithmmusteventuallybeimplemente

5、dbyacomputerprogramB.'salgorithmforsolvingaproblemisthesameastheprogramwrittenforthatproblemThefeasibilityofC.algorithmmeansthatinstructioncannothavetwomeaningsSeveraloftheaboveD.arewrong6.thefollowingstatementiswrong[NanjingUniversityofScienceandTechnology,2000,one,2(1.5point

6、s)](1)themeaningofthealgorithminplacemeansthatnoadditionalauxiliaryspaceisneeded(2)atthesamescalen,thecomplexityO(n)algorithmisalwaysbetterthanthecomplexityO(2n)algorithmintime(3)theso-calledtimecomplexityistheupperboundoftheexecutiontimeoftheestimationalgorithmintheworstcase(

7、4)thehighertheleveloflanguageimplementation,thelowertheexecutionefficiencyofthesamealgorithmA.(1)B.(1),(2)C.(1),(4)D.(3)7.,logically,thedatastructurecanbedividedintotwocategories.[WuhanTransportationUniversityofscienceandtechnology,1996,4(2points)A.dynamicstructure,staticstruc

8、ture,B.sequentialstructure,chainstructureC.linearstructure,no

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。