2012--据结构英文试卷A及答案.docVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
2012--据结构英文试卷A及答案

北 京 交 通 大 学 软 件 学 院 2012―2013学年第一学期期末考试试题 Data Structure and Algorithm Design(A) Class: ____Student Number: _____Name: ________ Teacher________ No. I II III IV V VI Total Mark I. Single-Choice(20 points) 1. The height of a binary tree that contains 1023 elements is at most ( 1 ) and at least ( 2 ). A. 1022 B.1023 C. 1024 D.9 E.10 F.11 2. If the sequence of pushing elements into a stack is a,b,c, which output sequence is impossible?( ). A.abc B.bca C.cba D.cab 3.How many minimum-cost spanning trees are there for an undirected connected graph with n vertices and e edges? ( ) A. must be only one B. n-1 C. n-e D. not sure 4. When using the adjacency matrix A to represent a undirected graph with n nodes and e edges, the degree of the node vi can be computed by formula ( ). A. QUOTE B. QUOTE /2 C. e /2 D. QUOTE 5. In the worst case, time complexity of quicksort will be degraded to ( ). A.O(n) B.O(n2) C.O(nlogn) 6.In order to find a specific key in an ordered list with 100 keys using binary search algorithm, the maximum times of comparisons is ( ). A. 25 B.10 C. 1 D.7 7. Consider the following pseudo-code, which indicates part of a standard binary tree algorithm. print( node ) { print data; if( there is a left child ) print( left child ); if( there is a right child ) print( right child ); } Which of the following is the standard name for this algorithm? ( ) A. Inorder traversal B. Preorder traversal C. Postorder traversal D. Binary search 8.Which is not the property of a B-tree of order m? ( ) A. The root node has m subtree at most B. All leaf nodes are at the same level. C. The keys in every node are ordered. D. All leaf nodes are connected by links. 9. Suppose that we have 1000 distinct integers, which are in the range from 0 to 50. If u

文档评论(0)

baa89089 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档