简答题\n \n \n \n \n \n \n \n \n \n \n int x=x+y 执行频度为( )\n \n \n \n \n \n \n \n \n \n \n A.\n 0\n \n \n \n \n \n \n B.\n 1\n \n \n \n \n \n \n C.\n n\n \n \n \n \n \n \n D.\n n2\n \n \n \n \n \n简答题\n 175模型机A的存入指令store M的作用是将寄存器R的内容存入存储单元M（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n 二分检索算法对数组下标0-19的元素进行划分子问题，中间元素下标为（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 10\n \n \n \n \n \n \n B.\n 9\n \n \n \n \n \n \n C.\n 8\n \n \n \n \n \n简答题\n \n \n \n \n \n \n 195连通图如下，结点2的深度优先数dfn(2)=2 结点5 dfn(5)=5,则结点4的dfn(4)=____\n \n \n \n \n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 17数组中元素如下：31 201 68 17 51 54 189 10 315 76，归并算法递归层次为（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 5\n \n \n \n \n \n \n B.\n 4\n \n \n \n \n \n \n C.\n 3\n \n \n \n \n \n \n D.\n 2 \n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 19在快速排序算法中，元素个数为n，一次划分的比较次数是（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n n-1次\n \n \n \n \n \n \n B.\n n次\n \n \n \n \n \n \n C.\n n+1次\n \n \n \n \n \n \n D.\n n+2次\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 low＞high\n \n \n \n \n \n \n B.\n low＞mid\n \n \n \n \n \n \n C.\n low ＜=high28二分检索树中，由根到所有内结点的距离之和称为{内部路径长度}\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 40这个递归式是线性非齐次的（ ）\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 读程序，确定程序功能 T指向一棵二元树，其中DATA(T):结点T存储的数据；LCHILD(T)：指向结点T的左儿子，RCHILD(T)指向结点T的有儿子。procedure POSTORDER(T) if T≠null then call POSTORDER(LCHILD(T)) call POSTORDER(RCHILD(T)) if (LCHILD(T)或RCHILD(T)有一个为空） then PRINT DATA(T) endifend PREORDER以下说法正确的是( )\n \n \n \n \n \n \n \n \n \n \n A.\n 进行后序遍历\n \n \n \n \n \n \n B.\n 后序遍历二元树并输出度为1的结点 \n \n \n \n \n \n \n C.\n 后序遍历二元树，并输出度小于等于1的结点\n \n \n \n \n \n简答题\n 182设P是度为2的表达式树T的根结点，函数MR(P)表示表达式不使用store指令，至少需要多少个寄存器（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n 78分治策略将问题划分为规模相当的子问题时，平均效率最高（ ）\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 43所有的递归关系式都可以求解得到一个等价的非递归函数（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n 198 树边就是图对应的深度优先生成树的边（ ）\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 已知普通背包问题M=30，n=3 p=(35,30,25,5),w=(35,30,25,5),该背包问题最优解解向量X=（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 6/7,0,0,0\n \n \n \n \n \n \n B.\n 5/7,0,0,1\n \n \n \n \n \n \n C.\n 0,0,1,1\n \n \n \n \n \n \n D.\n 0,1,0,0\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 集合合并时间上界是O(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 C.\n 树结构表示法\n \n \n \n \n \n简答题\n 69 Kruscal算法生成最小生成树时只要边数小于n-1，加入的最小边不构成环即可（ ）\n简答题\n 188 宽度优先检索是把未检测的结点存入队列（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n 55从分治法的一般设计模式可以看出，用它设计出的程序一般是 递归算法 。（ ）\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 下列算法中不能解决0/1背包问题的是()。 A.贪心法 B.动态规划 C.回溯法 D.分支限界法\n简答题\n \n \n \n \n \n \n 51H(n)=2H(n-1)+1求解结果为H(n)=____\n \n \n \n \n \n \n \n \n \n