wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Digital Electronics

Total questions: 20

Worksheet time: 10mins

Name
Class
Date
1.

Which of the following logical operations is represented by the + sign in Boolean algebra?

a)

inversion

b)

AND

c)

OR

d)

complementation

2.

What is the result of the logical operation A AND B when A is true and B is false?

a)

true

b)

false

c)

undefined

d)

error

3.

In Boolean algebra, which operation is represented by the * sign?

a)

AND

b)

OR

c)

NOT

d)

XOR

4.

Which of the following is the complement of the Boolean variable A?

a)

A

b)

1

c)

0

d)

NOT A

5.

The output of a NOR gate is HIGH if ________.

a)

all inputs are HIGH

b)

any input is HIGH

c)

any input is LOW

d)

all inputs are LOW

6.

What is the result of the logical operation A OR B when A is false and B is true?

a)

true

b)

false

c)

undefined

d)

error

7.

If a 3-input AND gate has eight input possibilities, how many of those possibilities will result in a HIGH output?

a)

1

b)

2

c)

7

d)

8

8.

The Boolean expression for a 3-input AND gate is ________.

a)

X = AB

b)

X = ABC

c)

X = A + B + C

d)

X = AB + C

9.

The output of a NOT gate is HIGH when ________.

a)

the input is LOW

b)

the input is HIGH

c)

power is applied to the gate's IC

d)

power is removed from the gate's IC

10.

How is a J-K flip-flop made to toggle?

a)

J = 0, K = 0

b)

J = 1, K = 0

c)

J = 0, K = 1

d)

J = 1, K = 1

11.

A J-K flip-flop is in a "no change" condition when ________.

a)

J = 1, K = 1

b)

J = 1, K = 0

c)

J = 0, K = 1

d)

J = 0, K = 0

12.

What does the triangle on the clock input of a J-K flip-flop mean?

a)

level enabled

b)

edge-triggered

13.

In a 6-bit Johnson counter sequence there are a total of how many states, or bit patterns?

a)

2

b)

6

c)

12

d)

24

14.

How many flip-flops are required to make a MOD-32 binary counter?

a)

3

b)

45

c)

5

d)

6

15.

The terminal count of a modulus-11 binary counter is ________.

a)

1010

b)

1000

c)

1001

d)

1100

16.

The binary numbers A = 1100 and B = 1001 are applied to the inputs of a comparator. What are the output levels?

a)

A > B = 1, A < B = 0, A < B = 1

b)

A > B = 0, A < B = 1, A = B = 0

c)

A > B = 1, A < B = 0, A = B = 0

d)

A > B = 0, A < B = 1, A = B = 1

17.

What is the maximum count of states in a 4-bit binary counter?

a)

8

b)

16

c)

4

d)

32

18.

Which of the following represents the NAND operation in Boolean algebra?

a)

X = A * B

b)

X = (A * B)'

c)

X = A + B

d)

X = A + B'

19.

In a binary counter, what is the maximum count of states for a 3-bit counter?

a)

4

b)

6

c)

8

d)

16

20.

Which of the following represents the XOR operation in Boolean algebra?

a)

X = A + B

b)

X = A * B

c)

X = A ⊕ B

d)

X = (A * B)'