Teaching plan for Unit 3 I Aims Demands Get the students (1)to comprehend the text of Section A 2)to have a good grasp of the following points: ups and downs be /get involved with; hold work out: go through; for a time i met with all along; upon/on doing sth subsequently(consequently): harbor; see.as; at one's worst; why do/ not do sth; buy time; never too adj. to do sth
ynamic order statistics OS-SELECT(i, S): returns the i th smallest element in the dynamic set S. OS-RANK(, S): returns the rank ofx E S in the sorted order of s s elements IDEA: Use a red-black tree for the set S, but keep subtree sizes in the nodes
a weakness of hashing Problem: For any hash function h, a set of keys exists that can cause the average access time of a hash table to skyrocket An adversary can pick all keys from tkeU: h(k)=i for some slot i IDEA Choose the hash function at random independently of the keys