北航《算法与数据结构》在线作业一（BUAA algorithms and data structures online homework）.docVIP

下载本文档

171
0
约5.7千字
约 12页
2017-08-04 发布于河南
举报
版权申诉

北航《算法与数据结构》在线作业一（BUAA algorithms and data structures online homework）.doc

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

北航《算法与数据结构》在线作业一（BUAA algorithms and data structures online homework） BUAA algorithms and data structures online homework Total score: 100 test time: - Radio examination Radio examination questions (25 questions, 100 points) 1. using sequential lookup methods to find linear tables of length N, the average length of each element is (). A. n B. n/2 C. (n+1) /2 D. (n-1) /2 Full marks: 4 2. about the logical structure, the following statement is wrong The A. logical structure has nothing to do with the formation and content of the data element itself The B. logical structure is relative to the relative position of the data elements The logical structure of C. is independent of the number of nodes contained D. some of the very different data on the surface can have the same logical structure Full marks: 4 3. in the following four sorting methods, the largest additional memory requirement is () A. insertion sort B. select sort C. quick sort D. merge sort Full marks: 4 4. in all sorting methods, the number of key comparisons is independent of the initial order of records A. Hill sorting B. bubble sort C. insertion sort D. select sort Full marks: 4 5., with two strings (S1 and S2), the calculation of the location of the first occurrence of S1 in S2 is called (). A. connection B. pattern matching C. substr D. string length Full marks: 4 6., the sequential search method is suitable for storing linear tables with (linear) structure. A. hash table B. sequentially stores or connects storage C. compressed storage D. index storage Full marks: 4 7. a sequence with 24 records, using bubble sort, at least the number of comparisons is () A. 1 B. 23 C. 24 D. 529 Full marks: 4 8. determine the condition that an order stack (the most element is m) is empty. A. top = = 0 B. top = = m C. top = 0 D. top = = m Full marks: 4 9. in a two fork tree, the number of knots on the fourth layer is the maximum. A. 8 B. 15 C. 16 D. 31 Full marks: 4 10. in the following sorts of sorting methods, the lar