試卷名稱:110年 - 110 國立臺灣大學_碩士班招生考試_電信工程研究所丙組:資料結構與演算法(B)#113108
年份:110年
科目:研究所、轉學考(插大)◆資料結構與演算法
47. Which of the following are desirable properties of a hash function h(x)?

(A) If x1,...,xn are the items to be hashed. then the numbers h(x1),..., h(xn) should be uniformly distributed over the
(B) The range of h(x) should incinde a wide r range of integers.
(C) The range of h(x) should stay within the desired hash-table sizc.
(D) It should be computable in O( 1) time.
(E) It should take distinct values over all possible items to be hashed. integers.