|
|
A: <span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">顺序文件<span lang="EN-US"><span style="mso-tab-count: 1"> </span></span></span>
B: <span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">索引顺序文件<span lang="EN-US"><o:p></o:p></span></span> <p style="tab-stops: 210.0pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C: <span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">散列文件<span lang="EN-US"><span style="mso-tab-count: 1"> </span></span></span>
D: <span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">多关键字文件<span lang="EN-US"><o:p></o:p></span></span>
<p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">用有向无环图描述表达式<span lang="EN-US">(A+B)*((A+B)/A)</span>，至少需要顶点的数目为<strong><span lang="EN-US"><o:p></o:p></span></strong></span></p>
A:5
B:6
C:8
D:9
<p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt"><span style="mso-spacerun: yes"> </span>若在<span lang="EN-US">9</span>阶<span lang="EN-US">B-</span>树中插入关键字引起结点分裂，则该结点在插入前含有的关键字个数为<span lang="EN-US"><o:p></o:p></span></span></p><p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
A:4
B:5
C:8
D:9
<p style="LINE-HEIGHT: normal; TEXT-INDENT: -8.4pt; MARGIN-LEFT: 8.4pt; mso-char-indent-count: -.8" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">假设一棵完全二叉树按层次遍历的顺序依次存放在数组<span lang="EN-US">BT[m]</span>中，其中根结点存放在<span lang="EN-US">BT[0]</span>，若<span lang="EN-US">BT</span>中的结点有左孩子，则左孩子存放在<span lang="EN-US"><o:p></o:p></span></span></p><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
A: BT[i/2]<span style="mso-tab-count: 5"> </span><span style="mso-tab-count: 1"> </span>
B:BT[2*i-1]<o:p></o:p> <p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C: <span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US">BT[2*i]<span style="mso-tab-count: 5"> </span><span style="mso-spacerun: yes"> </span></span>
D: <span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US">BT[2*i+1]<o:p></o:p></span>
<p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">下列陈述中正确的是<span lang="EN-US"><o:p></o:p></span></span></p><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
A:<span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">二叉树是度为<span lang="EN-US">2</span>的有序树<span lang="EN-US"><o:p></o:p></span></span> <p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
B:<p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">二叉树中结点只有一个孩子时无左右之分<span lang="EN-US"><o:p></o:p></span></span></p><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C:<p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">二叉树中必有度为<span lang="EN-US">2</span>的结点<span lang="EN-US"><o:p></o:p></span></span></p><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
D:<p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'"><span lang="EN-US"> </span></span></p><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">二叉树中最多只有两棵子树，并且有左右之分<span lang="EN-US"><o:p></o:p></span></span></p>
<p style="TEXT-ALIGN: left; TEXT-INDENT: -21pt; MARGIN-LEFT: 21pt; mso-char-indent-count: -2.0" class="MsoNormal" align="left"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">设有一个顺序栈，<span lang="EN-US">6</span>个元素<span lang="EN-US">1</span>、<span lang="EN-US">2 </span>、<span lang="EN-US">3</span>、<span lang="EN-US">4</span>、<span lang="EN-US">5</span>、<span lang="EN-US">6</span>依次入栈，如果<span lang="EN-US">6</span>个元素出栈的顺序是<span lang="EN-US">2</span>、<span lang="EN-US">3</span>、<span lang="EN-US">4</span>、<span lang="EN-US">6</span>、<span lang="EN-US">5</span>、<span lang="EN-US">1</span>，则栈的容量至少应该是<span lang="EN-US"><o:p></o:p></span></span></p><p style="TEXT-ALIGN: left" class="MsoNormal" align="left"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span><span style="mso-spacerun: yes"> </span></span></p>
A:2
B:3
C:5
D:6
<p style="TEXT-ALIGN: left" class="MsoNormal" align="left"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">将两个各有<span lang="EN-US">n</span>个元素的有序表归并成一个有序表，其最少的比较次数是<span lang="EN-US"><o:p></o:p></span></span></p>
A:<p style="TEXT-ALIGN: left; TEXT-INDENT: 30.55pt; mso-char-indent-count: 2.91" class="MsoNormal" align="left"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt"><span lang="EN-US">n<span style="mso-spacerun: yes"> </span><span style="mso-spacerun: yes"> </span><span style="mso-spacerun: yes"> </span></span></span></p>
B:<p style="TEXT-ALIGN: left; TEXT-INDENT: 30.55pt; mso-char-indent-count: 2.91" class="MsoNormal" align="left"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt"><span lang="EN-US">2n-1<span style="mso-spacerun: yes"> </span><o:p></o:p></span></span></p>
C:<p style="TEXT-ALIGN: left; TEXT-INDENT: 30.55pt; mso-char-indent-count: 2.91" class="MsoNormal" align="left"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt"><span lang="EN-US">2n <span style="mso-spacerun: yes"> </span><span style="mso-spacerun: yes"> </span><span style="mso-spacerun: yes"> </span></span></span></p>
D:<p style="TEXT-ALIGN: left; TEXT-INDENT: 30.55pt; mso-char-indent-count: 2.91" class="MsoNormal" align="left"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt"><span lang="EN-US">n-1<o:p></o:p></span></span></p>
<p style="TEXT-INDENT: -10.5pt; MARGIN-LEFT: 10.5pt; mso-char-indent-count: -1.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">栈和队列都是<span lang="EN-US"><o:p></o:p></span></span></p><p style="TEXT-INDENT: -10.5pt; MARGIN-LEFT: 10.5pt; mso-char-indent-count: -1.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
A:<span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">限制存取位置的线性结构<span lang="EN-US"><span style="mso-tab-count: 2"> </span></span></span>
B: <span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">顺序存储的线性结构<span lang="EN-US"><o:p></o:p></span></span> <p style="TEXT-INDENT: -10.5pt; MARGIN-LEFT: 10.5pt; mso-char-indent-count: -1.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C: <span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">链式存储的线性结构<span lang="EN-US"><span style="mso-tab-count: 3"> </span></span></span>
D:<p style="TEXT-INDENT: -10.5pt; MARGIN-LEFT: 10.5pt; mso-char-indent-count: -1.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">限制存取位置的非线性结构<span lang="EN-US"><o:p></o:p></span></span></p>
<p style="tab-stops: 212.65pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">带行表的三元组表是稀疏矩阵的一种<span lang="EN-US"><o:p></o:p></span></span></p><p style="tab-stops: 212.65pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
A: <span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">顺序存储结构<span lang="EN-US"><span style="mso-tab-count: 1"> </span></span></span>
B:<span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">链式存储结构<span lang="EN-US"><o:p></o:p></span></span> <p style="tab-stops: 212.65pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C:<p style="tab-stops: 212.65pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">索引存储结构<span lang="EN-US"><span style="mso-tab-count: 1"> </span></span></span></p>
D:<p style="tab-stops: 212.65pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; COLOR: black; mso-bidi-font-size: 10.5pt">散列存储结构<span lang="EN-US"><o:p></o:p></span></span></p>
<p style="TEXT-INDENT: -10.5pt; MARGIN-LEFT: 10.5pt; mso-char-indent-count: -1.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">若长度为<span lang="EN-US">n</span>的线性表采用顺序存储结构，在其第<span lang="EN-US">i</span>个位置插入一个新元素的算法的时间复杂度为<span lang="EN-US"><o:p></o:p></span></span></p><p style="TEXT-INDENT: -10.5pt; MARGIN-LEFT: 10.5pt; mso-char-indent-count: -1.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
A: O(0)<span style="mso-spacerun: yes"> </span><span style="mso-spacerun: yes"> </span>
B: O(1)<span style="mso-spacerun: yes"> </span><o:p></o:p><p style="TEXT-INDENT: -10.5pt; MARGIN-LEFT: 10.5pt; mso-char-indent-count: -1.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C:<p style="TEXT-INDENT: -10.5pt; MARGIN-LEFT: 10.5pt; mso-char-indent-count: -1.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"> O(n)<span style="mso-spacerun: yes"> </span></span></p>
D: <span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"> O(n<sup>2</sup>) <o:p></o:p></span>
<p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">下面说法错误的是<span lang="EN-US"><o:p></o:p></span></span></p><p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span>(1</span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">）算法原地工作的含义是指不需要任何额外的辅助空间<span lang="EN-US"><o:p></o:p></span></span></p><p style="TEXT-INDENT: -31.5pt; MARGIN-LEFT: 31.5pt; mso-char-indent-count: -3.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">（<span lang="EN-US">2</span>）在相同的规模<span lang="EN-US">n</span>下，复杂度<span lang="EN-US">O(n)</span>的算法在时间上总是优于复杂度<span lang="EN-US">O(2<sup>n</sup>)</span>的算法<span lang="EN-US"> <o:p></o:p></span></span></p><p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">（<span lang="EN-US">3</span>）所谓时间复杂度是指最坏情况下，估算算法执行时间的一个上界<span lang="EN-US"><o:p></o:p></span></span></p><p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">（<span lang="EN-US">4</span>）同一个算法，实现语言的级别越高，执行效率就越低<span lang="EN-US"><o:p></o:p></span></span></p>
A:<p style="TEXT-INDENT: 23.2pt; mso-char-indent-count: 2.21" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt"><span lang="EN-US">(1)<span style="mso-spacerun: yes"> </span></span></span></p>
B:<p style="TEXT-INDENT: 23.2pt; mso-char-indent-count: 2.21" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt"><span lang="EN-US">(1),(2)<span style="mso-spacerun: yes"> </span><o:p></o:p></span></span></p>
C:<p style="TEXT-INDENT: 23.2pt; mso-char-indent-count: 2.21" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US">(1),(4)<span style="mso-spacerun: yes"> </span><span style="mso-spacerun: yes"> </span></span></p>
D:<p style="TEXT-INDENT: 23.2pt; mso-char-indent-count: 2.21" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US">(3)<o:p></o:p></span></p>
<p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">以下属于逻辑结构的是<span lang="EN-US"><o:p></o:p></span></span></p>
A:<p style="TEXT-INDENT: 17.95pt; mso-char-indent-count: 1.71" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">顺序表<span lang="EN-US"><span style="mso-spacerun: yes"> </span></span></span></p>
B:<p style="TEXT-INDENT: 17.95pt; mso-char-indent-count: 1.71" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">哈希表<span lang="EN-US"><span style="mso-spacerun: yes"> </span></span></span></p>
C:<p style="TEXT-INDENT: 17.95pt; mso-char-indent-count: 1.71" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">有序表<span lang="EN-US"><span style="mso-spacerun: yes"> </span></span></span></p>
D:<p style="TEXT-INDENT: 17.95pt; mso-char-indent-count: 1.71" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">单链表<span lang="EN-US"><o:p></o:p></span></span></p>
<p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span>ALV</span><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">树是一种平衡的二叉排序树，树中任一结点的<span lang="EN-US"><o:p></o:p></span></span></p><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span><span style="mso-spacerun: yes"> </span></span></p>
A: <span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">左、右子树的高度均相同<span lang="EN-US"><span style="mso-spacerun: yes"> </span><o:p></o:p></span></span><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
B:<p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"> </span><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">左、右子树高度差的绝对值不超过<span lang="EN-US">1<o:p></o:p></span></span></p><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C: <span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"> </span><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">左子树的高度均大于右子树的高度<span lang="EN-US"><span style="mso-spacerun: yes"> </span><o:p></o:p></span></span><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
D: <p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span> </span><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">左子树的高度均小于右子树的高度<span lang="EN-US"><o:p></o:p></span></span></p>
<p style="TEXT-INDENT: -14.15pt; MARGIN-LEFT: 14.15pt; mso-char-indent-count: -1.35" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">栈的两种常用存储结构分别为<span lang="EN-US"><o:p></o:p></span></span></p>
A:<p style="TEXT-INDENT: 15.75pt; MARGIN-LEFT: 13.95pt; mso-char-indent-count: 1.5; mso-para-margin-left: 1.33gd" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">顺序存储结构和链式存储结构<span lang="EN-US"><span style="mso-tab-count: 3"> </span></span></span></p>
B:<p style="TEXT-INDENT: 15.75pt; MARGIN-LEFT: 13.95pt; mso-char-indent-count: 1.5; mso-para-margin-left: 1.33gd" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">顺序存储结构和散列存储结构<span lang="EN-US"><o:p></o:p></span></span></p>
C:<p style="TEXT-INDENT: 15.75pt; MARGIN-LEFT: 13.95pt; mso-char-indent-count: 1.5; mso-para-margin-left: 1.33gd" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">链式存储结构和索引存储结构<span lang="EN-US"><span style="mso-tab-count: 3"> </span></span></span></p>
D:<p style="TEXT-INDENT: 15.75pt; MARGIN-LEFT: 13.95pt; mso-char-indent-count: 1.5; mso-para-margin-left: 1.33gd" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">链式存储结构和散列存储结构<span lang="EN-US"><o:p></o:p></span></span></p>
<p style="tab-stops: list 72.0pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">在图采用邻接表存储时，求最小生成树的<span lang="EN-US"> Prim </span>算法的时间复杂度为<span lang="EN-US"><o:p></o:p></span></span></p>
A:<p style="TEXT-INDENT: 21pt; mso-char-indent-count: 2.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span> O(n)<span style="mso-spacerun: yes"> </span><span style="mso-tab-count: 1"> </span><span style="mso-spacerun: yes"> </span></span></p>
B:<p style="TEXT-INDENT: 21pt; mso-char-indent-count: 2.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span> O(n+e)<span style="mso-spacerun: yes"> </span><o:p></o:p></span></p>
C:<p style="TEXT-INDENT: 21pt; mso-char-indent-count: 2.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"> O(n<sup>2</sup>)<span style="mso-spacerun: yes"> </span></span></p>
D:<p style="TEXT-INDENT: 21pt; mso-char-indent-count: 2.0" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"> O(n<sup>3</sup>)<o:p></o:p></span></p>
<p class="MsoNormal" style="LAYOUT-GRID-MODE: char"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">当采用分快查找时，数据的组织方式为<span lang="EN-US"><o:p></o:p></span></span></p><p class="MsoNormal" style="LAYOUT-GRID-MODE: char; TEXT-INDENT: 21pt; mso-char-indent-count: 2.0"><span lang="EN-US" style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt"><span style="mso-spacerun: yes"> </span></span></p>
A:<span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">数据分成若干块，每块内数据有序<span lang="EN-US"><o:p></o:p></span></span> <p class="MsoNormal" style="LAYOUT-GRID-MODE: char; MARGIN-LEFT: 31.5pt; TEXT-INDENT: -10.5pt; mso-char-indent-count: -1.0; mso-para-margin-left: 2.0gd"><span lang="EN-US" style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt"><span style="mso-spacerun: yes"> </span></span></p>
B:<p class="MsoNormal" style="LAYOUT-GRID-MODE: char; MARGIN-LEFT: 31.5pt; TEXT-INDENT: -10.5pt; mso-char-indent-count: -1.0; mso-para-margin-left: 2.0gd"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">数据分成若干块，每块内数据不必有序，但块间必须有序，每块内最大（或最小）的数据组成索引块<span lang="EN-US"><o:p></o:p></span></span></p>
C:<p class="MsoNormal" style="LAYOUT-GRID-MODE: char; MARGIN-LEFT: 21pt"><span lang="EN-US" style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt"> </span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">数据分成若干块，每块内数据有序，每块内最大（或最小）的数据组成索引块<span lang="EN-US"><o:p></o:p></span></span></p>
D:<p class="MsoNormal" style="LAYOUT-GRID-MODE: char; MARGIN-LEFT: 21pt"><span lang="EN-US" style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt"> </span><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">数据分成若干块，每块（除最后一块外）中数据个数需相同<span lang="EN-US"><o:p></o:p></span></span></p>
<p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">倒排文件的主要优点是<span lang="EN-US"><o:p></o:p></span></span></p><p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
A: <span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">便于进行插入和删除运算<span lang="EN-US"><span style="mso-spacerun: yes"> </span></span></span>
B: <span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'"><span lang="EN-US"> </span>便于进行文件的恢复<span lang="EN-US"><o:p></o:p></span></span> <p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C: <span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'" lang="EN-US"> </span><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">便于进行多关键字查询<span lang="EN-US"><span style="mso-spacerun: yes"> </span></span></span>
D:<p style="LINE-HEIGHT: normal" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'"><span lang="EN-US"> </span>节省存储空间<span lang="EN-US"><o:p></o:p></span></span></p>
<p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">引起循环队列队头位置发生变化的操作是<span lang="EN-US"><o:p></o:p></span></span></p><p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
A: <span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">出队<span lang="EN-US"><span style="mso-spacerun: yes"> </span></span></span>
B:<span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">入队<span lang="EN-US"><o:p></o:p></span></span> <p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt" lang="EN-US"><span style="mso-spacerun: yes"> </span></span></p>
C:<p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">取队头元素<span lang="EN-US"><span style="mso-spacerun: yes"> </span></span></span></p>
D:<p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">取队尾元素<span lang="EN-US"><o:p></o:p></span></span></p>
<p class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">下面关于线性表的叙述中，错误的是<span lang="EN-US"><o:p></o:p></span></span></p>
A:<p style="TEXT-INDENT: 17.95pt; mso-char-indent-count: 1.71; tab-stops: 112.5pt 234.0pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">线性表采用顺序存储，必须占用一片连续的存储单元。<span lang="EN-US"><o:p></o:p></span></span></p>
B:<p style="TEXT-INDENT: 17.95pt; mso-char-indent-count: 1.71; tab-stops: 112.5pt 234.0pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">线性表采用顺序存储，便于进行插入和删除操作。<span lang="EN-US"><o:p></o:p></span></span></p>
C:<p style="TEXT-INDENT: 17.95pt; mso-char-indent-count: 1.71; tab-stops: 112.5pt 234.0pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">线性表采用链接存储，不必占用一片连续的存储单元。<span lang="EN-US"><o:p></o:p></span></span></p>
D:<p style="TEXT-INDENT: 17.95pt; mso-char-indent-count: 1.71; tab-stops: 112.5pt 234.0pt" class="MsoNormal"><span style="FONT-FAMILY: 宋体; mso-bidi-font-size: 10.5pt">线性表采用链接存储，便于插入和删除操作。<span lang="EN-US"><o:p></o:p></span></span></p>
<p style="LINE-HEIGHT: normal; TEXT-INDENT: -17.95pt; MARGIN-LEFT: 17.95pt; mso-char-indent-count: -1.71" class="MsoPlainText"><span style="mso-hansi-font-family: 宋体; mso-bidi-font-family: 'Times New Roman'">在目标串<span lang="EN-US">T</span>［<span lang="EN-US">0..n-1</span>］<span lang="EN-US">=</span>″<span lang="EN-US">xwxxyxy</span>″中，对模式串<span lang="EN-US">P</span>［<span lang="EN-US">0..m-1</span>］<span lang="EN-US">=</span>″<span lang="EN-US">xy</span>″进行子串定位操作的结果是<span lang="EN-US"><o:p></o:p></span></span></p>
A:1
B:2
C:3
D:5
|
|
发表于 2020-8-8 18:59:57
