资源描述：
《河南电大数据结构期末复习题(历年考试题)》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。
1、河南电大数据结构期末复习题3(历年考试题)1.outputatwo-dimensionalarray,thetimecomplexityofallelementsinb[m][n](D).A.(),B.()(m,ten,n),C.()(N2),D.()(m*n),(n)2.whenthesearchvalueisxinanorderedtablestoredintheorderofNinlength,thetimecomplexityofthemostefficientalgorithmis(C).A.()(B.),(),C.()(),D.()
2、(n)3.whenstoringastackintheorderofanarrayofsizen,assumingthatthestackspaceisrepresentedbytop==n,youshouldfirstexecutethe(B)statementtomodifythetoppointerwheninsertinganelementintothestack.A.top++;B.top--;C.top=0;D.top;4.inatree,(C)thereisnoprecursornode.A.treenode,B.leafnode
3、,C.rootnode,D.emptynode5.itisknownthattheedgesetofatreeisrepresentedas{,,,,,,,},thenthetreeisdepth(B).Supposetherootnodehasadepthof0.A.2,B.3,C.4D.5Theconnectedgraphof6.nverticescontainsatleast(A)edges.A.n1,1B.n,C.n(n-1)/2,D.,n(n,1)7.t
4、henumberofverticesoftheundirectedgraphisn.,thenthegraphhasatmost(B)edges.A.none,1,B.n(n,1)/2,C.n(n+1)/2D.n(n,1)8.whenusingopenhashingtoresolveconflicts,thevaluesofeachtableitem(C)arethesameineachofthesynonymoussubtableslinkedbyeachhashaddress.A.keyB.,nonkeycode,C.hashfunctio
5、n,D.,adomainThe9.hashfunctionshouldhavesuchapropertythatthelettervalueshouldtakeeveryvalueofitsrangewithin(D)probability.A.MaxB.minimumC.averageD.equalTwo.Fillintheblanks1.objectorientedfeaturesshouldincludeobjects,classes,inheritance,polymorphism,messaging,communications,an
6、dsoon.2.,inthesinglelinkedlisttosettheheader,theroleofadditionalnodesistoinsertanddeleteanyelementinthetablewhentheoperationisthesame3.ifthemaximumcapacityofthesequentialstackisMaxSize,andthetop==-lrepresentsthestackspace,theconditionofthestackistop==MaxSixe14.inatreewithahe
7、ightof5,thereareatmost63nodesinthetwotree.Supposetheheightoftherootnodeis0.5.inaheap,thevalueofthetopnodeisthemaximumofallnodes.6.thespanningspanningtreeofundirectedgraphswithnverticescontainsn-1edges.7.ina5orderBtree,eachnodecontainsatmost4keycodes.Three、judgmentquestions(V
8、)1.lineartableifthechainstoresaid,donotneedtodeleteelementsinmobile.(x)2.,i
