Answer 1

left shift, right shift, and, or, not and xor operation of binary number.

Example :

2 & 3
= 10 & 11 (Binary equivalent)
= (1&1) (0&1) (bit by bit)
= 10 (because 1st 2 1's and value is 1, then 0 and 1 of 2nd bit gives 0)
= 2