数据结构期末试卷b3860

数据结构期末试卷b3860

ID:30890395

大小:54.00 KB

页数:11页

时间:2019-01-03

数据结构期末试卷b3860_第1页
数据结构期末试卷b3860_第2页
数据结构期末试卷b3860_第3页
数据结构期末试卷b3860_第4页
数据结构期末试卷b3860_第5页
资源描述:

《数据结构期末试卷b3860》由会员上传分享,免费在线阅读,更多相关内容在工程资料-天天文库

1、数据结构期末试卷B3860Abook,likeaship,leadsusfromanarrowplacetoaninfiniteseaoflife,CalebDatastructurefinalpaperB1,judge:10points,1pointperquestion.Afullbinarytreeisalsoacompletebinarytree0Thebinarytreecanberepresentedbyanorderedtreeof0orlessthanorequalto2(a)Inthekcrosstreewherethereisonlyadegreeofzeroandadeg

2、reeofk,therearenOofthenodesof0,andnkforthenodesofk,andnO二nk+104,theshortestpathtoanothervertexinagraphwiththerightconnectionisnotnecessarilytheonlyone0Intheundirectedgraphofnnodes,ifthenumberofedgesislessthannminus1,thegraphmustbeanunconnectedgraphThebinarytreewiththeshortestpathlengthofthetreemusth

3、avenonodeof10Thelookupofthehashtabledoesnotneedtobecomparedtothekeyword0Thebinarysearchmethodcanbeusedtosearchforlinearlinkedlistsorderedbyvalue0Iteratingoveraheapdoesnotnecessarilygetanorderedsequence0Becausethelasttripofhillsortisthesameasthedirectinsertionsortprocess,theformermustspendmoretimetha

4、nthelatter02,fillintheblanks:(20points,2pointseach.)AnodewithadegreeofzerodegreesisanodewithnosubtreesThesonofthesamenodeiscalledaInabinarylinkedlistwithnnodes,thereisanemptychainTheadjacencymatrixisusedfortheadjacencymatrixstoragemethod,andtheadjacencymatrixmustbea4,agivensequence{100,86,4&73,35,39

5、,42,57,66,21},asdefinedbytheheapstructure,itisanheapInthecaseofdirectinsertionsort,thenumberofdataiscomparedwiththeinitialorderofdata.Inthecaseofdirectselection,thenumberofdatacomparedwiththedataisinThefunctionH,whichconvertsthenodekeywordtothelocationofthenode,iscalledorThesequenceofnkeywordsissort

6、edrapidly,andthespacecomplexityoftheaveragecaseisChoice:20points,2pointsperproblem・1,willbeatotallyhas100nodeinthebinarytreefromtoptobottom,fromlefttorightinturnonnodenumber,theserialnumberoftherootnodeis1,thenumberofnode,sleftchildfor49NumbersforA.98b.99C.50d.48TheshapeoftheheapisaA.AC.completebina

7、rytreed.balancebinarytreeForthehashfunctionH(key)二keyMOD13,thekeywordthatiscalledasynonymisA.35and41b.23and39C.15and44d.25and51Pointouthowmanycomparisonsarerequiredtofind12inordertables{2,5,5,7,10,14,

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

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

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