1. Given a number having only one ’1′ and all other ’0′s in its binary representation, find position of the only set bit.
2.Find the position of the most significant set bit in a 64-bit signed long int.
3. Count the number of bits that are set to 1, in a 64-bit signed integer.
4. RangeOperation on A(m, n) = m & (m+1) & ... & (n-1) & n.
5. Bit Flooding outward and backward of a set Bit.
2.Find the position of the most significant set bit in a 64-bit signed long int.
3. Count the number of bits that are set to 1, in a 64-bit signed integer.
4. RangeOperation on A(m, n) = m & (m+1) & ... & (n-1) & n.
5. Bit Flooding outward and backward of a set Bit.
No comments:
Post a Comment