讲解S17H、辅导Java/c++程序语言、辅导Python编程、讲解2-hash claim 讲解Database|讲解Database
- 首页 >> OS编程 Contents
Problem 0.1. 3 S17H Prove the 2-hash claim in the case t = 2. Assume that h is defined as
the following. Given an n-bit seed a = (a1, a2, . . . , an) and an n-bit key x = (x1, x2, . . . , xn),
the hash function is:
ha(x) = Xn
i=1
xiai mod 2.
Problem 0.2. 3 Let Q[1..n] be a min-heap with n elements. Describe the procedure
decrease-key which given an index i ≤ n and a positive value d, decreases the key at index
i by subtracting from it the value d.
Problem 0.1. 3 S17H Prove the 2-hash claim in the case t = 2. Assume that h is defined as
the following. Given an n-bit seed a = (a1, a2, . . . , an) and an n-bit key x = (x1, x2, . . . , xn),
the hash function is:
ha(x) = Xn
i=1
xiai mod 2.
Problem 0.2. 3 Let Q[1..n] be a min-heap with n elements. Describe the procedure
decrease-key which given an index i ≤ n and a positive value d, decreases the key at index
i by subtracting from it the value d.