简答题\n 169中缀表达式转化为后缀表达式过程中，遇到操作数直接输出不进栈（ ）\n简答题\n 二分检索算法是利用（ ）实现的算法\n简答题\n \n \n \n \n \n \n \n \n \n \n 下图是某图的深度优先生成树，判断结点2是关节点的原因( )\n \n \n \n \n \n \n \n \n \n \n A.\n L(5)＞=DFN(2)\n \n \n \n \n \n \n B.\n L(6)＞DFN(2)\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 48二元检索树中，一次成功检索在一个内节点处结束（ ）\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 151 货郎担问题求解模型可以用于求解欧拉回路问题（ ）\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(n)=（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n O(1)\n \n \n \n \n \n \n B.\n O(n)\n \n \n \n \n \n \n C.\n O(log n)\n \n \n \n \n \n \n D.\n O()\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 120 贪心法解决问题的关键是确定一个量度标准，通过这个量度标准确定处理顺序，同时要证明根据这个顺序处理，能够得到最优解（ ）\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 86 logn3的渐进表达式=O____[分]\n \n \n \n \n \n \n \n \n \n简答题\n n=5 作业1-5的效益值分别为（35，30，25，20，15），期限值分别为（2，1，2，3，1），使用FJS算法，最后集合的根和元素个数是（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n 带有期限值的作业调度问题，已知n=4，(p1，p4，p3，p2)＝(100,20,15,10)和(d1，d4，d3，d2)＝(2,1,2,1)。使用FJS算法，数组F(0,2)的初值分别是（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 0，0，0\n \n \n \n \n \n \n B.\n 0，1，2\n \n \n \n \n \n \n C.\n -1，-1，-1 \n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 如果把求最大最小元素递归算法MAXMIN递归调用过程用一棵二元树表示，元素表{2,43,-15,-18,15,80,17,31,47}，则对应的二元树的高度是（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n 1\n \n \n \n \n \n \n B.\n 2\n \n \n \n \n \n \n C.\n 3\n \n \n \n \n \n \n D.\n 4\n \n \n \n \n \n简答题\n 134 检索成本最小的二分检索树高度一定是最小的（ ）\n简答题\n \n \n \n \n \n \n \n \n \n \n 124 Prim算法中，数组元素near[j]取值为0表示已经结点j已经选入到树中；不为0，表示与结点j相邻的最小成本边的另一个端点。（ ）\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 集合的三种表示形式中，执行查找操作时间为O(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 C.\n 树结构表示法\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 7个作业，期限值分别为：1，2，3，3，5，6，6；先考虑作业7，需要考虑的时间片是（ ）\n \n \n \n \n \n \n \n \n \n \n A.\n F(7)\n \n \n \n \n \n \n B.\n F(6)\n \n \n \n \n \n \n C.\n F(0)\n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 下图是15谜问题的初始状态， 由初始状态( )达到目标状态\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 回溯法的效率不依赖于下列哪些因素（ ）\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 34 在给定数据列表中检索某个数据，假设数据总个数为n，成功检索的种类是____种。\n \n \n \n \n \n \n \n \n \n简答题\n \n \n \n \n \n \n \n \n \n \n 193双连通图中是不含有关节点的连通图（ ）\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 115在对问题的解空间树进行搜索的方法中，一个活结点最多有一次机会成为活结点的是____\n \n \n \n \n \n \n \n \n \n