河南电大数据结构期末复习题(历年考试题)（henan tv university data structure review ）

《河南电大数据结构期末复习题(历年考试题)（henan tv university data structure review ）》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、河南电大数据结构期末复习题5(历年考试题)（HenanTVUniversitydatastructurereview5）1.,thetimecomplexityofthefollowingprogramsegmentis(C).For(inti=0;i

2、ndP,thecalculationofthelocationofthefirstoccurrenceofPintiscalled(B).A.B.C.stringpatternmatchingsubstrreplaceD.series.4.,theadvantageofusingtwo-waylinkedlistasthestoragestructureoflineartableis(B).A.facilitatesone-wayinsertionanddeletionofoperations.B.facilitatesbidirectionalinsertionanddeletionofop

3、erations.C.savesspace,D.facilitatesdestruction,andstructurereleasesemptyrequests5.setthechainstack,thenodestructureis(data,link),andtopisthepointertothetopofthestack.Ifyouwanttoinsertapointertothetopofthestacktopofthestackpointer,youshouldperform(C)operations.(s).A.topone>link=S;B.sone>link=topone>l

4、ink;topone>link=S;C.S-->link=top;top-S;D.sone>link=top;top-topone>link;6.theheightofafullytwoforktreewith35nodesis(A).SupposetheheightoftheemptytreeisoneL.A.5B.6C.7D.87.,thetimecomplexityofinsertinganewelementintoaheapwithnnodesis(C).A.O(1),B.0(n),C.O(log2n),D.O(nlog2n)8.inaAVLtree,therangeofequilib

5、riumfactorforeachnodeis(A).A.onelto1B.,one2~2C.1to2D.Oto19.anundirectedgraphwithnverticesandNedgesmustbe(B).A.connected,B.disconnected,C.acyclic,D.hasloopTwo,fillin,fillintheappropriatecontentinabove(everyday2points,L4points)1.datastructuresincludethreeaspects:logicalstructure,storagestructureandope

6、rationofdata.2.thespacetakenbyaone-dimensionalarrayiscontinuous.Butarrayelementsarenotnecessarilysequentiallyaccessed,usuallyaccessedbyelement(subscript(orordinalnumber)).3.theuppertriangularpartorthelowertriangularpartofanranksymmetricmatrixiscompressedinaone-dimensionalarray,andtheone-dimensionala

7、rrayneedsatleastn(n+1)/2elements.4.foratreewithnnodes,thesumofthedegreesofallnodesinthetreeis(n-1).5.attheheightofanidealbalanceof3,thetwoforktreecontainsatleast8nodes,assumingthattheheightoftherootno