Bit operations Based Interview Questions

1. Count Number of Bits in the Given Number
   
   Find the number of bits in a Number is one of the most commonly asked interview questions which has many different types of correct Solutions The most efficient,simple and general one is the following :

   Solution
   

2. Obvious Inefficient Solution for Bit Count
   

   Solution
   
3. Most Common and Hard Microsoft Byte based Question
   
   First some definitions for this problem: a) An ASCII character is one byte long and the most significant bit in the byte is always 0. b) A Kanji character is two bytes long. The only characteristic of a Kanji character is that in its first byte the most significant bit is 1. Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
4. Convert lowercase characters into Uppercase using Bitwise Operators
   
5. How to Reverse bits of an unsigned integer.
   

   Solution

6. How do we test whether a number is a power of two?
   
   Solution