成考院校在线答案
- 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;">37、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设有序表中的元素为(13,18,24,35,47,50,62),则在其中利用二分法查找值为24的元素需要经过( )次比较。</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;">38、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设顺序线性表的长度为30,分成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>
- 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;">20、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">若有18个元素的有序表存放在一维数组A[19]中,第一个元素放A[1]中,现进行二分查找,则查找A[3]的比较序列的下标依次为( )</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;">17、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设某哈夫曼树中有199个结点,则该哈夫曼树中有( )个叶子结点。</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;">20、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设一组初始记录关键字序列为(45,80,55,40,42,85),则以第一个记录关键字45为基准而得到一趟快速排序的结果是( )。</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;">29、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设某棵二叉树中只有度数为0和度数为2的结点且度数为0的结点数为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;">28、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设一棵完全二叉树中有65个结点,则该完全二叉树的深度为( )。</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;">20、<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" 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;">队列是一种( )的线性表。</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;">23、<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>