Suppose we are executing the DGIM algorithm for approximate counting of bits in a stream. Let the window size be 1000.

(a) What is the largest possible bucket size in the representation of this stream?

(b) Suppose each of the last 1000 bits is 1. What is the smallest possible size of the largest bucket in the representation of the window?

1 answer

256

Ask a New Question or answer this question.

Similar Questions

How will water volume, incline gradient, and temperature affect the energy of a stream?2. Suppose a stream has a low volume but
1. 1 answer
A Christmas fruitcake has Poisson-distributed independent numbers of sultana raisins, iridescent red cherry bits, and
1. 0 answers
How many bits are used to encode a single color in the RGB scheme?Question 5 options: 24 bits 32 bits 8 bits 16 bits
1. 1 answer
Jennifer is writing an algorithm to analyze a play that she is reading. What type of algorithm would be appropriate for this
1. 1 answer