Unsorted singly sorted doubly linked list linked list

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ists. unsorted singly sorted doubly linked list, linked list, worst-case worst-case S EARCH(L, k) I NSERT(L, x) D ELETE(L, x) S UCCESSOR(L, x) M INIMUM(L) M AXIMUM(L) Problem 4-2. k-universal hashing and authentication Let H be a class of hash functions in which each hash function h H maps the universe U of keys to {0, 1, . . . , m - 1}. We say that H is k-universal if, for every fixed sequence of k distinct keys x(1) , x(2) , . . . , x(k) and for any h chosen at random from H, the sequence h(x(1) ), h(x(2) ), . . . , h(x(k) ) is equally likely to be any of the mk sequences of length k with elements drawn from {0, 1, . . . , m - 1}. (b) Suppose that the universe U is the set of n-tuples of values drawn from p = {0, 1, . . . , p - 1}, where p is prime. Consider an element x = x0 , x1 , . . . , xn-1 U . For any n-tuple a = a0 , a1 , . ....
View Full Document

Ask a homework question - tutors are online