成考院校在线答案
- 2022-09-12 [单选] <p class="p" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:widow-orphan;text-align:justify;text-justify:inter-ideograph;">31、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:12.0000pt;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;"> <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;">24、<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、……、n，经过栈的作用后输出序列的第一个元素是n，则输出序列中第i个输出元素是（ ）。</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;">27、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设某棵三叉树中有40个结点，则该三叉树的最小高度为（ ）。</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;">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;">28、<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;">23、<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>
- 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;">设一个有序的单链表中有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;">33、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">循环队列SQ的存储空间是数组d[m],队头、尾指针分别是front和rear，则执行入队后其尾指针值rear是</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;">36、<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;"> <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;">for(i=0;i<n;i++) c[i]=i;</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="MsoPlainText" style="margin-right:0.0000pt;mso-para-margin-right:0.0000gd;mso-para-margin-left:0.0000gd;mso-pagination:widow-orphan;">18、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设一组权值集合W={2，3，4，5，6}，则由该权值集合构造的哈夫曼树中带权路径长度之和为（ ）。</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>