Suppose we pick a near-universal random hash function h with range {1,2,3,4} and hash the elements in {1,2,3,4,5,6,7,8,9} with it. What is the tightest upper bound on the expected number of elements that collide with h(1)? [ignoring h(1) itself]

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

how do I approach this question? Can you show me step by step Please.

 
Suppose we pick a near-universal random hash function h with range {1,2,3,4} and hash the elements in {1,2,3,4,5,6,7,8,9} with it. What is
the tightest upper bound on the expected number of elements that collide with h(1)? (ignoring h(1) itself)
O 2
Transcribed Image Text:Suppose we pick a near-universal random hash function h with range {1,2,3,4} and hash the elements in {1,2,3,4,5,6,7,8,9} with it. What is the tightest upper bound on the expected number of elements that collide with h(1)? (ignoring h(1) itself) O 2
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY