Free Printable Number System and Digital Logic Quiz

1.

The binary equivalent of the decimal number 25 is:

a)

11001

b)

10011

c)

11101

d)

10110

2.

The octal number 57 is equal to decimal:

a)

47

b)

48

c)

49

d)

57

3.

The hexadecimal number 2F equals decimal:

a)

45

b)

47

c)

41

d)

53

4.

Which of the following is not a valid binary number:

a)

10101

b)

11002

c)

1111

d)

100

5.

Decimal 255 in hexadecimal is:

a)

FF

b)

EE

c)

111

d)

F0

6.

The base of hexadecimal number system is:

a)

2

b)

8

c)

10

d)

16

7.

The binary equivalent of octal 345 is:

a)

11100101

b)

011100101

c)

10110101

d)

111000101

8.

The decimal equivalent of binary 1011.101 is:

a)

11.25

b)

11.5

c)

11.75

d)

10.75

9.

Which one of the following conversions is correct:

a)

(45)10=(100101)2

b)

(45)10=(110101)2

c)

(45)10=(101101)2

d)

(45)10=(111101)2

10.

Decimal 64 is equivalent to octal:

a)

100

b)

77

c)

70

d)

101

11.

The (r–1)’s complement of (1001)2 is:

a)

0110

b)

1000

c)

1110

d)

0111

12.

The r’s complement of (1001)2 is:

a)

1111

b)

0110

c)

0111

d)

0111+1=1000

13.

In decimal (r=10), the 9’s complement of 4578 is:

a)

5421

b)

5422

c)

5521

d)

5420

14.

In decimal (r=10), the 10’s complement of 4578 is:

a)

5421

b)

5422

c)

5420

d)

5521

15.

Which of the following is used for subtraction in digital systems:

a)

Only r–1’s

b)

Only r’s

c)

Either r or (r–1)’s

d)

None

16.

The 1’s complement of binary 0101100 is:

a)

1010011

b)

1010010

c)

0101101

d)

1001101

17.

The 2’s complement of binary 0101100 is:

a)

1010100

b)

1010101

c)

1010011

d)

1010010

18.

The 9’s complement of decimal 6000 is:

a)

3999

b)

4000

c)

4999

d)

3000

19.

For base-16, the (r–1)’s complement of A2 is:

a)

5D

b)

5E

c)

5F

d)

6D

20.

The 2’s complement is obtained by:

a)

Inverting all bits

b)

Inverting all bits +1

c)

Adding 1 to MSB

d)

Subtracting 1 from LSB

21.

Binary addition 1011+1101:

a)

10100

b)

11000

c)

10101

d)

11010

22.

Binary subtraction 1101–101:

a)

1000

b)

1110

c)

1010

d)

1100

23.

Octal addition 57+65:

a)

144

b)

143

c)

142

d)

145

24.

Octal subtraction 725–146:

a)

557

b)

567

c)

577

d)

547

25.

Hex addition A9+3F:

a)

E8

b)

E9

c)

F8

d)

188

26.

Hex subtraction 2A–1F:

a)

0B

b)

0C

c)

0D

d)

1D

27.

Multiplication (101)2×(11)2:

a)

111

b)

1101

c)

1001

d)

1111

28.

Division (10100)2÷(10)2:

a)

101

b)

1001

c)

1110

d)

1010

29.

Hex multiplication (A)×(3):

a)

1D

b)

1E

c)

1C

d)

1B

30.

Octal multiplication (12)×(7):

a)

106

b)

104

c)

107

d)

105

31.

Which of the following is a universal gate?

a)

AND

b)

OR

c)

NAND

d)

XOR

32.

The output of an OR gate is 1 when:

a)

All inputs 0

b)

All inputs 1

c)

At least one input 1

d)

All inputs same

33.

The basic logic gates are:

a)

AND, OR, NOT

b)

NAND, NOR, XOR

c)

AND, NOR, XOR

d)

NAND, OR, NOT

34.

Which gate is equivalent to a bubbled AND gate?

a)

NAND

b)

NOR

c)

XOR

d)

XNOR

35.

The output of NAND gate when both inputs are 1 is:

a)

1

b)

0

c)

Undefined

d)

Same as input

36.

The Boolean expression A + A’B simplifies to:

a)

A + B

b)

A’ + B

c)

A + AB

d)

A + B’

37.

The dual of Boolean expression A + (BC) is:

a)

A(B+C)

b)

(A+B)C

c)

A + B + C

d)

A(BC)

38.

The complement of expression A + B is:

a)

A’ + B’

b)

A’B’

c)

(A’ + B)

d)

(AB)’

39.

Which law is Idempotent?

a)

A + A = A

b)

A + A = 0

c)

A·A = 0

d)

A + 1 = 1

40.

The absorption law is:

a)

A + AB = A

b)

A + B = AB

c)

A(A + B) = B

d)

A + A’ = 1

41.

Gray code equivalent of binary 1010:

a)

1111

b)

1101

c)

1110

d)

1011

42.

Binary equivalent of Gray code 1101:

a)

1001

b)

1011

c)

1110

d)

1100

43.

Gray code property:

a)

Successive differ in 2 bits

b)

Successive differ in 1 bit

c)

Successive same

d)

Not used

44.

Gray code for decimal 7:

a)

1001

b)

0100

c)

0101

d)

0111

45.

Gray code is widely used in:

a)

Multiplexing

b)

Minimization

c)

Error detection

d)

Rotary shaft encoders

46.

Expression AB + A’C is:

a)

SOP

b)

POS

c)

Canonical

d)

None

47.

Expression (A + B)(A + C) is:

a)

SOP

b)

POS

c)

Canonical

d)

None

48.

Canonical SOP example:

a)

AB + C

b)

A’B’C + ABC’

c)

(A + B)(B + C)

d)

(A + B + C)

49.

Canonical POS example:

a)

(A + B)(A + C)

b)

(A + B + C)(A + B’ + C’)

c)

AB + BC

d)

A + B

50.

Number of minterms for n variables:

a)

2n – 1

b)

n²

c)

2n

d)

n!

51.

Simplify A + A’B:

a)

A + B

b)

AB

c)

B

d)

A’ + B

52.

Simplify (A + B)(A + B’):

a)

A

b)

B

c)

A + B

d)

AB

53.

Simplify (A + B)(A’ + B):

a)

B

b)

A

c)

AB

d)

A + B

54.

Simplify (AB + A’C + BC):

a)

AB + A’C

b)

AB + BC

c)

AC + BC

d)

AB + C

55.

Simplify (A + A’B)C:

a)

(A + B)C

b)

AC + B

c)

AC + BC

d)

AB + AC

56.

A K-map for 2 variables has:

a)

2

b)

4

c)

6

d)

8

57.

For 3 variables, K-map has:

a)

6

b)

8

c)

4

d)

16

58.

Adjacent 1’s in K-map grouped as:

a)

2 only

b)

4 only

c)

2,4,8

d)

Any

59.

K-map grouping reduces:

a)

Literals

b)

Minterms

c)

Gates

d)

All of above

60.

Simplified expression of minterms (1,3,7,5) in 3-variable K-map:

a)

A + C

b)

B + C

c)

A + B

d)

A’ + C

Number System and Digital Logic Quiz

Total questions: 60

Worksheet time: 20mins

Similar Resources on Wayground