How many '1' will be there in the binary representation of the following expression (assume 16 bit number ) 12+61+128+1024

How many '1' will be there in the binary representation of the following expression (assume 16 bit number ) 12+61+128+1024 Correct Answer 6

(1484)10 = (10111001100)2 So, there are 6 (six) ‘1’ of the following expression.

Related Questions

Consider 4-bit gray code representation of numbers. Let  h3 h2 h1 h0 be the gray code representation of a number n and g1g2g3g0 be the gray code representation of the number (n + 1) modulo 16. Which one of the following functions is correct?