[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fjxe5KDtQv0DbkmbTATrYc7WvqZojP3XBmLBGB3TwcE4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2023-10-20 20:33:29",100886850,[8,9,10,11],"哈希函数构造的越复杂越好,因为这样随机性好,冲突小","除留余数法是所有哈希函数中最好的","不存在特别好与坏的哈希函数,要视情况而定","若需在哈希表中删去一个元素,不管用何种方法解决冲突都只要简单",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},5,"51098eb29d521c180c30053820bdd87d","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2ace84c662cea14822cdec66b329bb9a.jpg","数据结构（2023秋）","6e3cc22d97f74a1187ac7709254cc691","哈希表","下面关于哈希(Hash,杂凑)查找的说法正确的是_______.A.B. C.D",[21,26,35,44,53],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":34,"source":24,"type":25},[],100886851,[30,31,32,33],"A\u002FC","B\u002FD","C\u002FA","D\u002FB","若采用链地址法构造散列表,散列函数为H(key)=key MOD 17,则需 ((1)A) 个链表.这些链的链首指针构成一个指针数组,数组的下标范围为_______. (1) A.17 B. 13 C. 16 D. 任意(2) A.0至17 B. 1至17 C. 0至16 D. 1至16",{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":24,"type":25},[],100886853,[39,40,41,42],"8","3","5","9","设哈希表长为14,哈希函数是H(key)=key%11,表中已有数据的关键字为15,38,61,84共四个,现要将关键字为49的结点加到表中,用二次探测再散列法解决冲突,则放入的位置是_______",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":24,"type":25},[],100886855,[48,49,50,51],"k-1次","k次","k+1次","k(k+1)\u002F2次","假定有k个关键字互为同义词,若用线性探测法把这k个关键字存入散列表中,至少要进行多少次探测?_______",{"answer":54,"createTime":55,"id":56,"options":57,"question":62,"source":24,"type":25},[],"2023-10-20 20:33:30",100886856,[58,59,60,61],"k","k+1","k(k+1)\u002F2","1+k(k+1)\u002F2","哈希查找中k个关键字具有同一哈希值,若用线性探测法将这k个关键字对应的记录存入哈希表中,至少要进行_______次探测"]