简答题\n 二元比较树中，内部路径长度I和外部路径长度E之间得关系是（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n 37二分检索问题种，成功检索的平均检索次数=总次数/（n+1）（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 对\n \n \n \n \n \n \n B.\n 错\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 74 汉诺塔问题得递归求解使用的是线性递归（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 对\n \n \n \n \n \n \n B.\n 错\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 158 树是一种半线性结构，但是可以通过一定的限制将其转换为线性结构，如对二元树的先序遍历（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 对\n \n \n \n \n \n \n B.\n 错\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 130 每对结点间的最短路径问题可以看成，求n次单源点最短路问题（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 对\n \n \n \n \n \n \n B.\n 错\n \n \n \n \n \n简答题\n \n \n \n \n \n \n 181形成表达式a-b*c+d的最优汇编代码（模型机A），最优代码的第一句是____\n \n \n \n \n \n \n \n \n \n简答题\n 采用贪心算法的最优装载问题的主要计算量在于将集装箱依其重量从小到大排序，故算法的时间复杂度为 ( ) 。\n简答题\n \n \n \n \n \n \n 108回溯法搜索解空间树时，常用的两种剪枝函数为____和____ \n \n \n \n \n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 算法是由若干条指令组成的有穷序列，且要满足输入、输出、确定性和有限性等性质。（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 对\n \n \n \n \n \n \n B.\n 错\n \n \n \n \n \n简答题\n 189宽度优先检索程序BFS中，已被访问结点w，visited(w)=1（ ）\n简答题\n 13已知n个数据得列表，最坏情况比较次数（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n PROC MERGESORT(low,high)if low＜high then mid=(low+high)/2 CALL MERGESORT(low,mid)CALL CALL MERGE(low,mid,high) MERGE是两个子序列的合并算法，归并排序算法,空白处选择（ ） \n \n \n \n \n \n \n \n \n \n \n A.\n MERGESORT(mid,high)\n \n \n \n \n \n \n B.\n MERGESORT(low,mid+1,high)\n \n \n \n \n \n \n C.\n MERGESORT(mid,high-1)\n \n \n \n \n \n \n D.\n MERGESORT(mid+1,high)\n \n \n \n \n \n简答题\n \n \n \n \n \n \n 101____是问题能用动态规划算法求解的前提\n \n \n \n \n \n \n \n \n \n简答题\n \n \n \n \n \n \n 202 15谜问题，初始状态如下，空白牌编号为16，position(16)=____，less(15)=____\n \n \n \n \n \n \n \n \n \n简答题\n 140动态规划求解0/1背包问题，函数表示法求解的缺点是分段函数中各阶段不容易确定，而图示法容易通过平移和图的合并确定分段（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n 194深度优先数DFS是对图进行深度优先检索过程中访问结点的顺序（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 对\n \n \n \n \n \n \n B.\n 错\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 快速分类算法i＜p则交换两个元素，元素列表如下：5,4,3,2,5,9,6,8,7，经过一次划分后列表是 （ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 5,4,3,2,5,9,6,8,7\n \n \n \n \n \n \n B.\n 2,4,3,5,5,9,6,8,7\n \n \n \n \n \n \n C.\n 2,3,4,5,5,6,7,8,9\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 快速分类算法中划分算法元素交换条件i＜p改为i＜=p,算法会（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 加快划分效率\n \n \n \n \n \n \n B.\n 有相同元素时，无法继续执行 \n \n \n \n \n \n \n C.\n 有相同元素时，具有稳定性\n \n \n \n \n \n \n D.\n 没有影响\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 163逆后序遍历就是先序遍历（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 对\n \n \n \n \n \n \n B.\n 错\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 129 解决N个资金在M个项目中配置的问题，可以使用多段图问题建模求解。按照项目M的数量，多段图可以分为M+1个阶段，起点s（第一阶段）表示没有给任何项目分配任何资金，汇点t表示给M个项目分配N个资金。边(i,j)表示给第i个项目分配j个资金，结点(i,j)表示前i个项目分配了j个资金，0＜=j＜=N，除起点和汇点外，其余阶段含有n+1个结点.（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 对\n \n \n \n \n \n \n B.\n 错\n \n \n \n \n \n