Embed presentation
Download to read offline
![Q3) [2 points] Using the DGIM method, show step by step how the bits and buckets for the
following stream with window of size N = 15 will be updated as bits 01011 arrive (show the
update after each bit arrival). Note that bits arrive in the following order: 0 , 1 , 0 , 1 , 1 , and they
enter the window from the right and leave from the left of the window.](https://image.slidesharecdn.com/q3-2points-usingthedgimmethod-showstepbystephowthebitsa-230220235901-1e3ca27c/75/Q3-2-points-Using-the-DGIM-method-show-step-by-step-how-the-bits-a-docx-1-2048.jpg)
The document outlines a step-by-step guide for updating the bits and buckets of a data stream using the DGIM method with a sliding window size of 15. It details the order of bit arrivals (0, 1, 0, 1, 1) and how they affect the window as they enter from the right and leave from the left. The focus is on illustrating the maintenance of data structure during the specified bit sequence.
![Q3) [2 points] Using the DGIM method, show step by step how the bits and buckets for the
following stream with window of size N = 15 will be updated as bits 01011 arrive (show the
update after each bit arrival). Note that bits arrive in the following order: 0 , 1 , 0 , 1 , 1 , and they
enter the window from the right and leave from the left of the window.](https://image.slidesharecdn.com/q3-2points-usingthedgimmethod-showstepbystephowthebitsa-230220235901-1e3ca27c/75/Q3-2-points-Using-the-DGIM-method-show-step-by-step-how-the-bits-a-docx-1-2048.jpg)