题库 第6049页
单选题：一个大小为11的散列表，散列函数为H(key)=key mod 11，采用线性探测冲突解决策略。如果现有散列表中仅有的5个元素均
一个大小为11的散列表，散列函数为H(key)=key mod 11，采用线性探测冲突解决策略。如果现有散列表中仅有的5个元素均位于下标为奇数的位置，问：该散列表的平均不成功查找次数是多少？ @[C](2)A. 6/11B. 1C. 16…
单选题：Given the following game tree, the red node will be pruned with
Given the following game tree, the red node will be pruned with α-β pruning algorithm if and only if __. @[D](3)![bt.j…
单选题：Suppose that the replacement selection is applied to generate lo
Suppose that the replacement selection is applied to generate longer runs with a priority queue of size 5. Given the seq…
单选题：The Online Hiring Algorithm ( hire only once ) is described as t
The Online Hiring Algorithm ( hire only once ) is described as the following: ```int OnlineHiring ( EventType C[ ], int…
单选题：Given a set of activities $$S = \{ a_1, a_2, \cdots , a_n \}$$.
Given a set of activities $$S = \{ a_1, a_2, \cdots , a_n \}$$. Each $$ a_i$$ takes place during a time interval $$ [s_…
单选题：After splaying at node 1 in the given tree, which of the followi
After splaying at node 1 in the given tree, which of the following statements about the resulting tree is TRUE? @[C](2…
单选题：Insert 28, 23, 54, 61, 98, 37 into an initially empty AVL tree f
Insert 28, 23, 54, 61, 98, 37 into an initially empty AVL tree first. Then immediately insert one of the following keys…
单选题：Insert 28, 23, 54, 61, 98, 37 into an initially empty AVL tree f
Insert 28, 23, 54, 61, 98, 37 into an initially empty AVL tree first. Then immediately insert one of the following keys…
单选题：After splaying at node 2 in the given tree, which of the followi
After splaying at node 2 in the given tree, which of the following statements about the resulting tree is FALSE? @[D](…
单选题：After inserting 7 into the 2-3 tree given in the figure, how man
After inserting 7 into the 2-3 tree given in the figure, how many of the following statements are TRUE? @[C](2)(S1) Th…
