成考院校在线答案
- 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;">27、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">一个队列的入队序列是1，2，3，4，则队列的输出序列是</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;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设完全无向图中有n个顶点，则该完全无向图中有（ ）条边。</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;">31、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设无向图G中有n个顶点，则该无向图的最小生成树上有（ ）条边。</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" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;">32、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">具有n个结点的完全二叉树的深度为</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;">36、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设有n个待排序的记录关键字，则在堆排序中需要（ ）个辅助记录单元。</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;">34、<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;">21、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设某二叉树中度数为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;">，度数为2的结点数为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;">2</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;">22、<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;">25、<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;">30、<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;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">m</span><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;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">n</span><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>