若采用鏈地址法構造散列表散列函數為H(key)=key MOD 則需 (()) 個鏈表這些鏈的鏈首指針構成一個指針數組數組的下標范圍為 (()) 【南京理工大學 一() (分)】
() A． B C D 任意
() A．至 B 至 C 至 D 至
關於雜湊查找說法不正確的有幾個( ) 【南京理工大學 一 (分)】
()采用鏈地址法解決沖突時查找一個元素的時間是相同的
()采用鏈地址法解決沖突時若插入規定總是在鏈首則插入任一個元素的時間是相同的
()用鏈地址法解決沖突易引起聚集現象
()再哈希法不易產生聚集
A B C D [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/22934.html
