【简答题】设有两个散列函数H1(K)=K mod 13和H2(K)=K mod 11+1,散列表为了[0...12],用双重散列法(又称二次散列法)解决冲突。函数H1用来计算散列地址,当发生冲突时,H2作为计算下一个探测地址的地址增量。假定某一时刻散列表T的状态为:下一个入的关键码为42,其插入位置是【 】。
【单选题】听力原文: The Canadian police say that the new North American Free Trade Agreement which is to open frontiers across the continent has been exploited by drug smugglers from South America. The mafia can no...