Precept4 - Computer Science 340 Reasoning about Computation Precept 4 Problem 1 Consider the family of hash functions discussed in class ha,b(x

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science 340 Reasoning about Computation Precept 4 Problem 1 Consider the family of hash functions discussed in class h a,b ( x ) = ( ax + b mod p )( mod n ) where a, b ∈ { 0 , . . . p - 1 } and a 6 = 0. Consider a hash function h a,b drawn uni- formly and at random from this family. For any x 1 , x 2 ∈ { 0 , . . . , p - 1 } , x 1 6 = x 2 , show that Pr[ h a,b ( x 1 ) = h a,b ( x 2 )] 1 /n. Problem 2 Consider a variant of the family of hash functions discussed in class h a ( x ) = ( ax mod p )( mod n ) where a ∈ { 1 , . . . p - 1 } . Consider a hash function h a drawn uniformly and at random from this family. For any x 1 , x 2 ∈ { 0 , . . . , p - 1 } , x 1 6 = x 2 , show that Pr[ h a ( x 1 ) = h a ( x 2 )] 2 /n. Problem 3 Consider the algorithm outlined in class to estimate the number of distinct queries in a query log using a random hash function h : U [0 , 1]. Here U is the universe of all queries. Assume that we can use a truly random hash function. Recall that the estimator
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This homework help was uploaded on 01/29/2008 for the course COS 340 taught by Professor Charikarandchazelle during the Fall '07 term at Princeton.

Page1 / 2

Precept4 - Computer Science 340 Reasoning about Computation Precept 4 Problem 1 Consider the family of hash functions discussed in class ha,b(x

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online