做在答题纸上,在试题纸上做解答按零分处理。数据结构的（Make it on the answer sheet, answer on the test paper, and divide it by zero. Data structure）.docVIP

下载本文档

11
0
约9.08千字
约 14页
2017-09-28 发布于河南
举报
版权申诉

做在答题纸上,在试题纸上做解答按零分处理。数据结构的（Make it on the answer sheet, answer on the test paper, and divide it by zero. Data structure）.doc

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

做在答题纸上,在试题纸上做解答按零分处理。数据结构的（Make it on the answer sheet, answer on the test paper, and divide it by zero. Data structure）

做在答题纸上,在试题纸上做解答按零分处理。数据结构的（Make it on the answer sheet, answer on the test paper, and divide it by zero. Data structure） There are many ways to destroy friendship, and the most thorough one is to borrow money Please put all the answers on the answer sheet, answer them on the test paper, and divide them by zero. The data structure algorithm questions can be described using the style of C or C++ language. A single choice. (the title of 10 items, each item of 2 points, a total of 20 points) Write the answer option and the title number on the answer sheet, and choose the wrong or not. 1., the length of n single linked list connected to the length of m single chain table after the algorithm, the time complexity is (). A., O (n), B., O (1) C., O (m), D., O (M + n) 2. set the array data[, M] as the storage space of the cyclic queue SQ, the front is the header pointer of the team, and the rear is the tail pointer of the queue, and then the value of the head pointer front is () after the operation of the team. A., front = front + 1, B., front = (front + 1)% (M - 1) C., front = (front - 1)%, m D., front = (front + 1)% m 3. the head of a nonempty generalized table (). A. cannot be a child table; B. can only be sub tables C. can only be atomic D. and can be atoms or sub tables The time complexity of the 4. heap sorting in the worst case is (). A., O (log2, n), B., O (log2, N2) C., O (nlog2, n), D., O (N2) 5. let G1 = (V1, E1) and G2 = (V2, E2) be two graphs, if V1, V2, E1, E2, then call () A. G1 is the subgraph of G2, and B. G2 is the subgraph of G1 C. G1 is the connected component of D., and G2 G2 is the connected component of G1 6. in a tree with a degree of 3, the number of nodes is 2, the number of nodes is 2, the number of nodes is 1, and the number of nodes is 0 (3). A. 4, B. 5, C. 6, D. 7 7. a directed graph with n vertices and e arcs is represented by an adjacency table, and the time complexity of all arcs associated with a vertex VI is removed A., O (n), B., O (E), C.,