Exercise 1
Exercise 1
a) 10100000 c) 00010000
b) 01010111 d) 00101011
a) 10101111 c) 00010011
b) 01010000 d) 00101011
4. Carry out BCD subtraction for (68) – (61) using 10’s complement method.
a) 00000111 c) 100000111
b) 01110000 d) 011111000
a) 3 bits c) 12 bits
b) 6 bits d) 24 bits
a) 100011001010 c) 010110010111
b) 100010100111 d) 010110101101
a) 1 b) A c) 0 d) A’
9. De Morgan’s theorem states that _________
a) (AB)’ = A’ + B’ c) A’ + B’ = A’B’
b) (A + B)’ = A’ * B d) (AB)’ = A’ + B
a) S b) Z c) O d) X
14. The characters from 0 to 9 have their common digit as ___________
a) 1111 b) 0000 c) 0001 d) 1000
15. The number of characters that can be represented in ASCII-8 are ______________
a) 128 b) 256 c) 32 d) 64
21. The binary number 111 in its 2’s complement form is ____________
a) 010 b) 001 c) 000 d) 111