Homework 10 in CMSC 752: Storing a Sparse Table with O(1) Worst Case Access Time - Prof. W, Assignments of Computer Science

Download Homework 10 in CMSC 752: Storing a Sparse Table with O(1) Worst Case Access Time - Prof. W and more Assignments Computer Science in PDF only on Docsity! Fall 2008 CMSC 752: Homework 10 Due: Nov 24, Dec 1,3,8,10,11,12 (Oral HW) READING: The paper Storing a Sparse table with O(1) Worst Case Access Time by Fredman, Komlos, Szemeredi. (It is on the course website.) 1. (100 points) The Universe is [U ]. We are in the cell-probe model; however, each cell can hold an element of [U ]. Show that there is a Data Structure that will, given n elements, store them in n+o(n) cells, such that MEMBERSHIP queries take O(1) probes. Be prepared for the following: (a) Is this algorithm really practical? If so then in what settings? (b) What is a reasonable bound on the o(n)? (c) What is the reasonable bound on the O(1) probes? 1