成考院校在线答案
- 2022-09-12 [单选] <p class="MsoNormal" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.7000pt;mso-para-margin-left:0.0000gd;text-indent:-0.7000pt;mso-char-indent-count:-0.0700;mso-pagination:none;">17、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">用某种排序方法对线性表(25,87,21,47,15,27,63,35,20)进行排序时,元素序列的变化情况如下:</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p><p class="MsoNormal" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;"><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">(</span><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">1)25,87,21,47,15,27,63,35,20</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p><p class="MsoNormal" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;"><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">(2)20,15,21,25,47,27,63,35,87</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p><p class="MsoNormal" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;"><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">(3)15,20,21,25,35,27,47,63,87</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p><p class="MsoNormal" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;"><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">(4)15,20,21,25,27,35,47,63,87</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p><p class="MsoNormal" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;"><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">则采用的排序方法是___________排序长度为4。</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoPlainText" style="margin-right:0.0000pt;mso-para-margin-right:0.0000gd;mso-para-margin-left:0.0000gd;mso-pagination:widow-orphan;">40、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设某棵二叉树的高度为10,则该二叉树上叶子结点最多有( )。</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">28、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">下列各种排序算法中平均时间复杂度为O(n</span><sup><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;vertical-align:super;">2</span></sup><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">)是( )。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">17、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">单链表的存储密度</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">38、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设一棵m叉树中度数为0的结点数为N</span><sub><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;vertical-align:sub;">0</span></sub><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">,度数为1的结点数为N</span><sub><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;vertical-align:sub;">l</span></sub><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">,……,度数为m的结点数为Nm,则N</span><sub><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;vertical-align:sub;">0</span></sub><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">=( )。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">21、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">下列说法中错误的是</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">26、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;font-size:10.5000pt;mso-font-kerning:1.0000pt;">设一个栈的输入序列为A,B,C,D,则借助一个栈所得到的输出序列不可能是(</span><span style="font-family:Microsoft Yahei;font-size:10.5000pt;mso-font-kerning:1.0000pt;"> </span><span style="mso-spacerun:'yes';font-family:Microsoft Yahei;font-size:10.5000pt;mso-font-kerning:1.0000pt;"> )。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">24、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设无向图G中的边的集合E={(a,b),(a,e),(a,c),(b,e),(e,d),(d,f),(f,c)},则从顶点a出发进行深度优先遍历可以得到的一种顶点序列为( )。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;">27、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设有5000个待排序的记录关键字,如果需要用最快的方法选出其中最小的10个记录关键字,则用下列( )方法可以达到此目的。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-para-margin-left:0.0000gd;mso-pagination:none;">29、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">在n个结点的顺序表中,算法的时间复杂度是O(1)的操作是</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>