欢迎来到天天文库
浏览记录
ID:16269505
大小:21.65 KB
页数:14页
时间:2018-08-08
《2010年5月衔接自考02142数据结构导论复习资料2281(introduction to 02142 data structure in may 2010 review data 2281)》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库。
1、2010年5月衔接自考02142数据结构导论复习资料2281(Introductionto02142datastructureinMay2010reviewdata2281)1,inthemiddleofthenighttoreadfivedrums,butGuoMoruoworkhardforwork02142introductiontodatastructureintroductionSinglechoicequestion1.thebasicunitofdatais[.]A.dataite
2、mB.datatypeC.dataelementD.datavariable2.thetimecomplexityofthefollowingproceduresis[I=0;s=0;While(s3、thestoragemethodthatsavesthemostcomputationtimeis[A.singlelinkedlistB.singleheadlinkedlistC.doublelinkedlistD.singletailchainlistwithtailpointer4.fromalengthnofthesequencetableelementnumberI(1in),thenumberofelementsisrequiredtomoveforward[]A.n-iB.n-i4、+1C.n-i-1D.iInthe5.orderstackS,topisthetopofthestackpointer,pointingtothelocationofthetopelementofthestack,andelemisthearrayofstoringstack.ThenthemainstatementoftheelementEenteringstackoperationis[A.s.elem[top]=e;B.s.elem[top+1]=e;S.top=s.top+1;s.top5、=s.top+1;C.s.top=s.top+1;D.s.top=s.top+1;S.elem[top+1]=e;s.elem[top]=e;6.circularqueueinSQ,withanarrayofelem0--25storeddataelements,indicatingapositionbeforethesq.frontteamheadelement,sq.rearindicatesthecurrentpositionofthetailelements,withthecurrent6、sq.frontis20,sq.rearis12,thenthenumberofelementsinthequeuefor[]A.8B.16C.17D.187.isa10ordersymmetricmatrixA,thecompressedstoragerowmajororderstorage,A00asthefirstelement,thememoryaddressis0,eachelementhas1memoryaddressspace,thentheA45addressforthe[]A.7、13B.35C.17D.368.twonodeswith10nodes,theknotnumberof0is4,andtheknotnumberofdegree2is[]A.3B.4C.5D.69.pairsof100nodeswithacompletetwotree,accordingtothelayernumber,thenumberis49node,itsparentnodenumberis[]A.24B.25C.98D.9910.theonlytwotreethatcanbeunique8、lytransformedintoageneraltreeisA.rootnodewithoutleftchild,B.rootnodewithoutrightchildC.rootnodehastwochildren,D.rootnodehasnochildren11.thenumberofarcsofdirectedcompletegraphswithnnodesis[A.n2B.2nC.n(n-1)D.2n(n+1)12.theadjacencylistofthegraph,suchast
3、thestoragemethodthatsavesthemostcomputationtimeis[A.singlelinkedlistB.singleheadlinkedlistC.doublelinkedlistD.singletailchainlistwithtailpointer4.fromalengthnofthesequencetableelementnumberI(1in),thenumberofelementsisrequiredtomoveforward[]A.n-iB.n-i
4、+1C.n-i-1D.iInthe5.orderstackS,topisthetopofthestackpointer,pointingtothelocationofthetopelementofthestack,andelemisthearrayofstoringstack.ThenthemainstatementoftheelementEenteringstackoperationis[A.s.elem[top]=e;B.s.elem[top+1]=e;S.top=s.top+1;s.top
5、=s.top+1;C.s.top=s.top+1;D.s.top=s.top+1;S.elem[top+1]=e;s.elem[top]=e;6.circularqueueinSQ,withanarrayofelem0--25storeddataelements,indicatingapositionbeforethesq.frontteamheadelement,sq.rearindicatesthecurrentpositionofthetailelements,withthecurrent
6、sq.frontis20,sq.rearis12,thenthenumberofelementsinthequeuefor[]A.8B.16C.17D.187.isa10ordersymmetricmatrixA,thecompressedstoragerowmajororderstorage,A00asthefirstelement,thememoryaddressis0,eachelementhas1memoryaddressspace,thentheA45addressforthe[]A.
7、13B.35C.17D.368.twonodeswith10nodes,theknotnumberof0is4,andtheknotnumberofdegree2is[]A.3B.4C.5D.69.pairsof100nodeswithacompletetwotree,accordingtothelayernumber,thenumberis49node,itsparentnodenumberis[]A.24B.25C.98D.9910.theonlytwotreethatcanbeunique
8、lytransformedintoageneraltreeisA.rootnodewithoutleftchild,B.rootnodewithoutrightchildC.rootnodehastwochildren,D.rootnodehasnochildren11.thenumberofarcsofdirectedcompletegraphswithnnodesis[A.n2B.2nC.n(n-1)D.2n(n+1)12.theadjacencylistofthegraph,suchast
此文档下载收益归作者所有