2010年5月衔接自考02142数据结构导论复习资料2750（In May 2010, join the 02142 data structure introduction, review information 2750）.docVIP

下载本文档

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

2010年5月衔接自考02142数据结构导论复习资料2750（In May 2010, join the 02142 data structure introduction, review information 2750）.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文档。上传文档

2010年5月衔接自考02142数据结构导论复习资料2750（In May 2010, join the 02142 data structure introduction, review information 2750）

2010年5月衔接自考02142数据结构导论复习资料2750（In May 2010, join the 02142 data structure introduction, review information 2750） 8, not afraid of reading less, but remember: Xu Teli 9, the rise of the Chinese Reading -- Zhou Enlai 02142 introduction to data structures, review questions Single choice The basic unit of data is 1. [] A. data B. data type C. D. data variable data elements The following 2. of the time complexity is [] I=0; s=0; While (sn) {i++; S=s+i; } (A.O) (B.O) C.O (n) D.O (N2) 3. if a linear form in the most common operation is to insert an element and remove the first element after the last element, the way of saving storage operation time is [] Single list of A. single table B. only head pointer Single list of C. D. only the tail pointer of the double linked list 4. from a length n of the sequence table element number I (1 i n), the number of elements is required to move forward [] A.n-i B.n-i+1 C.n-i-1 D.i The order of the stack in S top 5. for the top of the stack pointer points to the top of the stack position where the elem element, array stack element, mainly e statements into the stack operation for [] A.s.elem top =e; B.s.elem top+1 =e; S.top=s.top+1; s.top=s.top+1; C.s.top=s.top+1; D.s.top=s.top+1; S.elem top+1 =e; s.elem top =e; 6. circular queue in SQ, with an array of elem 0 - - 25 stored data elements, indicating a position before the sq.front team head element, sq.rear indicates the current position of the tail elements, with the current sq.front is 20, sq.rear is 12, then the number of elements in the queue for [] A.8 B.16 C.17 D.18 7. is a 10 order symmetric matrix A, the compressed storage row major order storage, A00 as the first element, the memory address is 0, each element has 1 memory address space, then the A45 address for the [] A.13 B.35 C.17 D.36 8. with 10 nodes of the two binary tree, the nodes of degree 0 is 4, then the nodes of degree 2 is [] A.3 B.4 C.5 D.6 9. of a complete binary tree of two 100 nodes according to the layer number,