计算机应用基础数据结构部分试题及答案 3.docx
- 文档编号:865886
- 上传时间:2022-10-13
- 格式:DOCX
- 页数:15
- 大小:24.77KB
计算机应用基础数据结构部分试题及答案 3.docx
《计算机应用基础数据结构部分试题及答案 3.docx》由会员分享,可在线阅读,更多相关《计算机应用基础数据结构部分试题及答案 3.docx(15页珍藏版)》请在冰豆网上搜索。
计算机应用基础数据结构部分试题及答案3
计算机应用基础数据结构部分试题及答案(Applicationofcomputerbaseddatastructurequestionsandanswers)
Ourprideislargelybasedonourignorance!
-Lessing
Computerapplicationbasicdatastructurepartquestionsandanswers
1.choicequestions:
1.thecomplexityofthetimecomplexityofthefollowingprogramsegmentsis(
For(i=1;i<=n;i++)
For(j=1;j<=i;j++)
For(k=1;k<=j;k++)
X=x+1;
A.,O
(1),B.O(n),C.,O(N2),D.O(N3)
2.,inthedatastructure,thedatastructurecanbelogicallydividedinto()
A.dynamicstructureandstaticstructure,B.compactstructureandnoncompactstructure
C.linearstructureandnonlinearstructure,D.internalstructureandexternalstructure
3.datastructuresincludefourbasictypes:
set,linear,tree,andgraphstructures.
A.storagestructure,B.logicstructure,C.basicoperation,D.algorithmdescription
4.data()includesearch,insert,delete,updateandsort,etc..
A.storagestructure,B.logicstructure,C.basicoperation,D.algorithmdescription
5.thestoragestructureofdataincludesfourbasictypesofsequence,link,hash,and().
A.linearB.array,C.set,D.index
6.,thefollowing()isthebesttimecomplexity,i.e.,theshortestexecutiontime.
A.,O(n),B.O(logn),C.,O(nlogn),D.O(N2)
7.thecomplexityofthetimecomplexityofthefollowingprogramsegmentis()
For(inti=0;i For(intj=0;j A[i][j]=i*j; A.,O(M2),B.O(N2),C.,O(m*n),D.O(m+n) 8.()isnotthebasicfeatureofthealgorithm. A.correctness,B.lengthislimited,C.withinthespecifiedtimetocompleteD.certainty 9.theinputsequenceofastackis1,2,3,4,5,andthefollowingsequenceistheoutputsequenceofthestack. A.31245,B.41325,C.23415,D.14253 10.,intheNnodewithtwonodes,thenumberofchainsisempty,andthenumberoffieldsis(). A.,n-1,B.,2N-1,C.,n+1,D.,2n+1 1-5,D,C,B,C,D,,B,C,C,C,C 11.knowncompletetwoforktreehas30nodes,thenthewholetwoforktreehas()1degreesofnode. A.0,B.1,C.2,D.arenotsure 12.depthtwoKfulltree,atleast()node. A.,2k-1,B.,2k-2,C.,2k-1,D.,2k-2 13.depthtwoKfulltree,atmost()nodes. A.,2k-1,B.,2k-2,C.,2k-1,D.,2k-2 14.directinsertionsortofasetofrecords(54,38,96,23,15,60,72,45,83,60).Whenseventhrecordsareinsertedintoanorderedtable,comparisons(Times)areneededtofindtheinsertionposition. A.1,B.2,C.3,D.4 15.bisearchorderedtable(6,15,30,37,65,68,70,72,89,99,37)ifrequiredinordertofindelements,andtheelementsinthetable(compare). A.65,15,37,B.68,30,37,C.65,15,30,D.65,,15,30,37 16.alengthlineartablestorageorderoftheN,totheIelements(1In+1)toinsertanewelement,needfrombehindthefrontturnaftertheshift(elements). A.,n-i,B.,n-i+1,C.,n-i-1,D.,I 17.,asshowninthe4twoforktree,()isnotexactlytwoforktree. (A)(B)(C)(D); 18.forthelengthofanorderedliststoredinorderof18,iftheuseofbinarysearch,tofindthefifteenthelementsofthesearchlength(). A.3,B.4,C.5D.6 19.,with10000unorderedelements,youwanttopickthetop10elementswiththefastestspeed, Itisbettertochoose()sort. A.heapsort,B.quicksort,C.bubblesort,D.insertsort 20.computeralgorithmsreferto(). A.computingmethod,B.sortingmethod,C.,solvetheproblemoforderedsequence,D.schedulingmethod 11-15,B,C,A,C,D,,B,C,A,B,A 21.astackofsequences1,2,3,4,thenitsunlikelyoutputsequenceis(). A.1,2,3,4,B.,4,3,2,1,C.,1,3,4,2,D.4,,,1,2,3 22.foranytreewithtwobranches,ifitsjunctionnumberisN0,andtheknotnumberof2isN2,thenN0=(). A.,N2-1,B.,N2+1,C.,N2,D.,N2-2 The23.lineartableis() A.afinitesequence,whichcanbeemptyB.,afinitesequence,cannotbenull C.aninfinitesequencecanbeaninfinitesequenceofemptyD.,andcannotbenull 24.inalineartableoflengthN,thetotalnumberofelementsandmovingelementsneededtobecomparedis(x)whentheelementisdeleted A.(n+1),/2,B.n/2,C.,N,D.n+1 25.thetimecomplexityofinsertinganelementattheendofasequentialtableistheorderofmagnitude A.,O(n),B.O (1),C.,O(N2),D.O(logn) 26.setasinglechaintablepointerPpointstothenodeAI,ifyouwanttodeletetheAIafterthenode(ifthereis),youneedtomodifythepointeroperationfor(). A.,p->next=,p->next->next,B.,p=p->next,C.,p=p->next->next,D.,next=p 27.setasingletable,pointerPpointstothenodeAI,pointerfpointtothenewnodetoinsertx,thenwhenxinsertedinthelistoftwodataelementsbetweenAIandai+1,aslongasfirstmodify(),thenmodify()can. A.,p->next=,F,B.,p->next=,p->next->next C.,p->next=f->next,D.,f->next=,p->next E.f->next=nullF.f->next=p 28.setasingletable,po
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 计算机应用基础数据结构部分试题及答案 计算机 应用 基础 数据结构 部分 试题 答案
![提示](https://static.bdocx.com/images/bang_tan.gif)