2011年03月国二VF全真模拟试题答案详解08（In 2011 03 months in the two VF practice test detailed answers 08）.docVIP

下载本文档

2
0
约2.04万字
约 22页
2017-07-14 发布于河南
举报
版权申诉

2011年03月国二VF全真模拟试题答案详解08（In 2011 03 months in the two VF practice test detailed answers 08）.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文档。上传文档

2011年03月国二VF全真模拟试题答案详解08（In 2011 03 months in the two VF practice test detailed answers 08）

2011年03月国二VF全真模拟试题答案详解08（In 2011 03 months in the two VF practice test detailed answers 08） First, the multiple-choice question (1) D [Objective] to examine the candidates mastery of the complexity of the algorithm space. [algorithm] space complexity refers to the memory space needed to perform this algorithm. [test center link] algorithm time complexity. (2) C [Objective] to examine the grasp of stack and queue concepts. [problem points] stacks and queues are a special linear list of restricted operations that allow insertion and deletion only at the endpoint. The difference between the two is that the stack only allow for the insertion or deletion operations on one end of the table, is a linear form of LIFO; and the queue is allowed only insert one end of the table, delete operation on the other end, is a kind of linear table FIFO. The degree of coupling between modules reflects the independence of the modules, and also reflects the complexity of the system decomposition. According to the degree of coupling from weak to strong, can be divided into 5 stages, namely: data coupling, coupling, coupling control, public isomorphism coupling and content coupling. Option C) without this coupling mode. [test site links] evaluate the main criteria for module independence, as well as their definitions and classifications. (3) B [propositional purpose] examine the two tree traversal. [key] the preorder traversal problem solving two binary tree (DLR) refers to the access node, the left subtree traversal and traversal of the right subtree of the 3, the first access node, and then traverse the left subtree, right subtree traversal and, finally, in the left and right subtree traversal, the same rules apply that is, the root - left - right, before the traversal results the two fork tree ATBZXCYP. [test link] for this question, if you use the preorder traversal and the sequential traversal, the results are ZBTYCPXA and TZBACYXP. (4) D [Objective] to examine the idea of structured p