Question 1 :
Left shifting a number by 1 is always equivalent to multiplying it by 2.
0001 => 1
0010 => 2
0100 => 4
1000 => 8
Question 2 :
In the statement expression1 >> expression2. if expression1 is a signed integer with its leftmost bit set to 1 then on right shifting it the result of the statement will vary from computer to computer
Question 3 :
Bitwise & and | are unary operators
Bitwise & and | are not unary operators only bitwise ! is unary operator.
Question 4 :
Bitwise & can be used to check if more than one bit in a number is on.
Question 5 :
Bitwise & can be used to check if a bit in number is set or not.
Question 6 :
Bitwise & can be used to divide a number by powers of 2
Question 7 :
Left shifting an unsigned int or char by 1 is always equivalent to multiplying it by 2.
Question 8 :
On left shifting, the bits from the left are rotated and brought to the right and accommodated where there is empty space on the right?