Question 16
In 1's complement arithmetic, a negative zero is represented in 8 bits as:
In 1's complement, +0 is 00000000 and -0 is 11111111.
In 1's complement arithmetic, a negative zero is represented in 8 bits as:
In 1's complement, +0 is 00000000 and -0 is 11111111.
Convert the binary number 1011.101_2 into decimal.
1011_2 = 11. 0.101_2 = 1/2 + 0/4 + 1/8 = 0.5 + 0.125 = 0.625. So 11.625.
BCD code is also referred to as:
BCD (Binary Coded Decimal) uses weights 8, 4, 2, 1 for each decimal digit.
Minimize the Boolean function F(A, B, C) = A'B'C + A'BC + AB'C + ABC.
$Factor C: F = C(A'B' + A'B + AB' + AB) = C(1) = C.$
How many self-dual Boolean functions of 4 variables are possible?
Number of self-dual functions of n variables is 2^($2^{n-1})$. For n=4: 2^{$2^3}$ = $2^8$ = 256.