0% found this document useful (0 votes)
16 views2 pages

Exercise 1

The document consists of a series of multiple-choice questions related to binary coded decimal (BCD), boolean algebra, ASCII coding, and number representation methods. It covers topics such as BCD representation, boolean laws, EBCDIC codes, and complements. The questions are designed to test knowledge in digital systems and computer science concepts.

Uploaded by

2yarednigusse1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views2 pages

Exercise 1

The document consists of a series of multiple-choice questions related to binary coded decimal (BCD), boolean algebra, ASCII coding, and number representation methods. It covers topics such as BCD representation, boolean laws, EBCDIC codes, and complements. The questions are designed to test knowledge in digital systems and computer science concepts.

Uploaded by

2yarednigusse1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

10%

1. Binary coded decimal is a combination of __________

a) Two binary digits c) Four binary digits


b) Three binary digits d) Five binary digits

2. The decimal number 10 is represented in its BCD form as __________

a) 10100000 c) 00010000
b) 01010111 d) 00101011

3. Add the two BCD numbers: 1001 + 0100 =?

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

5. A three digit decimal number requires ________ for representation in the


conventional BCD format.

a) 3 bits c) 12 bits
b) 6 bits d) 24 bits

6. The excess-3 code for 597 is given by __________

a) 100011001010 c) 010110010111
b) 100010100111 d) 010110101101

7. In boolean algebra, the OR operation is performed by which properties?

a) Associative properties c) Distributive properties


b) Commutative properties d) All of the Mentioned

8. According to boolean law: A + 1 = ?

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

10. Complement of the expression A’B + CD’ is _________


a) (A’ + B)(C’ + D) c) (A’ + B)(C’ + D)
b) (A + B’)(C’ + D) d) (A + B’)(C + D’)

11. Simplify Y = AB’ + (A’ + B)C.

a) AB’ + C c) A’B + AC’


b) AB + AC d) AB + A

12. The EBCDIC code for the character A is ______________

a) digit : 1100 zone : 0001 b) digit : 1111 zone : 0001


c) digit : 1100 zone : 1010 d) digit : 1111 zone : 1010

13. Which of the following is not a character of the digit 1110?

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

16. The zone of alphabetic characters from A to O in ASCII is _____________


a) 1000 b) 0100 c) 0010 d) 0001

17. The representation of the number 8 in binary in ASCII-8 format _________


a) 00111000 b) 01001000 c) 1000 d) 00011000

18. Binary Coding for the letter X is ______________


a) 01011000 b) 00111000 c) 10001000 d) 00010100

19. __________________ is a straightforward method of representing positive and


negative numbers.
a) Radix b) Complement c) Sign Magnitude d) Encode

20. The 1’s complement of 1 in 4 bits is __________


a) 0001 b) 0 c) 1001 d) 1110

21. The binary number 111 in its 2’s complement form is ____________
a) 010 b) 001 c) 000 d) 111

22. The 10’s complement of 562 is __________


a) 436 b) 437 c) 512 d) 448

23. The 9’s complement of 6578 is ___________


a) 1234 b) 3421 c) 3124 d) 3420

You might also like