This preview shows page 1. Sign up to view the full content.
Unformatted text preview: b if the chunk is all 0s, or 10 b-1 if the chunk has a 1. 1 (b) Prove that you can compress the chunk summary computed in part (a) down to b consecutive bits, preserving their order. (Hint: multiply, mask, shift.) (c) Describe how to compute the most signiﬁcant 1 bit in the chunk summary word computed in part (b). (Hint: Use a static fusion-tree node. But take care not to rely on ﬁnding the most signiﬁcant 1 bit.) (d) Describe how to compute the most signiﬁcant 1 bit in the most signiﬁcant chunk with a 1 in it, and thus compute the overall most signiﬁcant 1 bit. 1 Here 0 k denotes 0 repeated k times. 1...
View Full Document
This note was uploaded on 01/20/2012 for the course CS 6.849 taught by Professor Erikdemaine during the Fall '10 term at MIT.
- Fall '10
- Data Structures