2009年09月计算机二级考试vf真题及解析（Analytical grade two examination Zhenti and VF computer in 2009 09 months）.docVIP

下载本文档

2
0
约1.44万字
约 12页
2017-08-21 发布于河南
举报
版权申诉

2009年09月计算机二级考试vf真题及解析（Analytical grade two examination Zhenti and VF computer in 2009 09 months）.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文档。上传文档

2009年09月计算机二级考试vf真题及解析（Analytical grade two examination Zhenti and VF computer in 2009 09 months）

2009年09月计算机二级考试vf真题及解析（Analytical grade two examination Zhenti and VF computer in 2009 09 months） This paper consists of Cathers highness contribution Doc document may at the WAP end of the browsing experience poor. Suggest you select TXT, or download the source file to the machine view. In September 2009 the National Computer Rank Examination two VF written questions and answers A choice of 1., the following data structure, which belongs to the nonlinear structure is (A. B. with circular queue queue chain C. two tree D. with the chain stack). Answer C parse tree are the following 2. nonlinear structure of the data structure, according to the principle of advanced after data access is (A. B. C. D. circular queue stack queue two fork tree). Answer: B parsing stack is advanced after or backward linear table analysis first out stack is advanced after LIFO or linear table 3. for circular queue, is correct in the following description (A. team head pointer is fixed to the B. team head pointer must be greater than the tail pointer team team head pointer must be less than C. the tail pointer D. team head pointer can be larger than the tail pointer may be smaller than the tail pointer team answers D analysis: if the team head pointer is greater than that of circular queue tail pointer team has to store the data if the team head pointer is less than if the head pointer is greater than the analytical team team team team that has been circulating among the tail pointer to store the data, if the team the head pointer is less than if the head pointer is greater than the team team team that has been circulating queue tail pointer data stored in the tail pointer that no cycle for 4. space complexity refers to (). The amount of data processed by the B. algorithm). The computer A. of storage space required by the algorithm in the implementation process The number of statements or instructions in the program for the C. algorithm the answer unit number A The temporary D. algorithm req