《数据结构》作业习题(homework exercises of data structure)

《数据结构》作业习题(homework exercises of data structure)

ID:14692782

大小:32.30 KB

页数:38页

时间:2018-07-30

《数据结构》作业习题(homework exercises of data structure)_第1页
《数据结构》作业习题(homework exercises of data structure)_第2页
《数据结构》作业习题(homework exercises of data structure)_第3页
《数据结构》作业习题(homework exercises of data structure)_第4页
《数据结构》作业习题(homework exercises of data structure)_第5页
资源描述:

《《数据结构》作业习题(homework exercises of data structure)》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、《数据结构》作业习题(Homeworkexercisesofdatastructure)Readagoodbook,likemakingagoodfriend.-Cangkejia"Datastructure"FeaturedExerciseJicuiBibliography:[1]nationalcomputertechnologyandsoftwareprofessionalqualification(level)examination2004and2005inthefirsthalfoftheexamination

2、questionsanalysisandsolutiontsinghuauniversitypress[2],LiangZuojuan,etc.,datastructureExercisesanswerandexaminationguidance,TsinghuaUniversitypressThefirstchapteristheintroductionJudgment:(ChineseAcademyofSciences1999)Sequentialstoragecanonlybeusedtostorelinearst

3、ructures.Thesequentiallookupmethodisapplicabletolineartableswithstoragestructuresofsequentialorlinkedstorage.-wrong-onFillintheblanks:(ChineseAcademyofSciences,1999)Foragivennelement,thelogicalstructuresthatcanbeconstructedare(,),(),(),()four.-setLinearstructureT

4、reestructureGraphstructureSelection:(CAS2001)Thecomputeralgorithmmusthave5characteristics:input,output,()andsoon.A.feasibility,portabilityandscalability,B.feasibility,certaintyandpovertyD.readability,securityandstabilityofC.deterministic,finiteandstableBQ&A:Unive

5、rsityofScienceandTechnologyBeijing(2002)Howarethelogicalstructuresofdatastoredincomputerstorage(orrepresentation)inseveralways?-sequentialmappingandnonsequentialmappingWhatarethecharacteristicsoflinearstructureandtreestructure?Thereisarelationshipbetweenthedatael

6、ementsinthestructureThereisarelationshipbetweenmultipledataelementsinthestructureSelection:(WuhanPolytechnic2002)Thecharacteristicsofanalgorithmthatcanbeprocessedwhenanillegaloperationoccursiscalled()A.correctness,B.readability,C.robustness,D.reliabilityCAnswer:(

7、WuhanPolytechnic2002)Thedifferencebetweensequentialstoragestructureandchainedstoragestructureinrepresentingdataelementsisexplained.TheproximityoflogicalrelationsrepresentedbyphysicallocationsUsingpointersinnodestoindicaterelationshipsAnswer:(NanjingPolytechnic200

8、2)5characteristicsofthealgorithmarebrieflydescribed.AbriefdescriptionofthetextbookSelection:(NanjingPolytechnic2002)Datastructureisadisciplineofcomputerprogram

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

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

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