wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

BooleanAlgebraBasics

Total questions: 99

Worksheet time: 55mins

Name
Class
Date
1.

The output of an exclusive-NOR gate is 1,Which input combination is correct?

a)

A = 1 B = 0

b)

A = 0 B = 1

c)

A = 0 B = 0

d)

none of the above

2.

If 3-input OR gate has 8 input possibilities how many possibilities will result in HIGH output?

a)

1

b)

7

c)

2

d)

8

3.

OR gate with schematic "bubbles" on its inputs performs the same functions as___gate.

a)

NOT

b)

EX-OR

c)

NAND

d)

NOR

4.

How many input and output required for multiplexer ?

a)

Many input and one output

b)

One input and many output

c)

One input and one output

d)

None of the above

5.

What is the boolean expression for this logic circuit?

a)

Q = NOT (A OR B)

b)

Q = NOT A AND B

c)

NOT A OR B = Q

d)

Q = (NOT A) OR B

6.

What is the boolean expression for this logic circuit?

a)

A OR B AND C = Q

b)

Q = (A AND B) OR C

c)

Q = A OR (B AND C)

d)

Q = (A OR B) AND C

7.

In this logic circuit, what is the output Q if the inputs A and C are 1?

a)

0

b)

We can't say

c)

1

8.

Which logic gate is this?

a)

AND

b)

OR

c)

NOT

9.

Which is the truth table for the AND gate?

a)
b)
c)
10.

Which logic gate take the input and negates it, turning 0 to 1 and 1 to 0?

a)

AND

b)

OR

c)

NOT

11.

The AND and OR gate both take two inputs, while the NOT gate takes just one. True or False?

a)

True

b)

False

12.

The NOT gate takes only one input (it is a unary operator). True or False?

a)

True

b)

False

13.

This is the truth table for which logic gate?

a)

AND

b)

OR

c)

NOT

14.

Which logic gate matches this truth table?

a)
b)
c)
15.

Which logic gate is this?

a)

AND

b)

OR

c)

NOT

16.

Which of these are boolean operators, implemented in the computer as logic gates?

Check all that apply

a)

NOT

b)

MOD

c)

OR

d)

AND

e)

DIV

17.

This is the truth table for which logic gate?

a)
b)
c)
18.

Which of these are boolean operators, implemented in the computer as logic gates?

Check all that apply

a)

NOT

b)

MOD

c)

OR

d)

AND

e)

DIV

19.

A + 0 =

a)

A

b)

1

c)

0

d)

My little pony

e)

~A

20.

A + 1 =

a)

1

b)

0

c)

A

d)

A pair of smelly sneakers

e)

~A

21.

~A + ~A =

a)

A

b)

~A

c)

1

d)

0

e)

Tinkerbell

22.

~ (~A) =

a)

A

b)

~A

c)

1

d)

0

e)

Ugly muffins

23.
X . ( Y . Z )
is the same as 
a)
X . Y + Z
b)
( X + Y ) + Z
c)
( X . Y ) . Z
d)
( X . Z ) + Y
24.

Which of these are logic gates?

a)

AND

b)

OR

c)

NOT

d)

IF

e)

ELSE

25.

Which logic gate does this symbol represent?

a)

AND

b)

OR

c)

NOT

d)

IF

e)

ELSE

26.

What is the output Y of this logic cricuit if A = 1, B = 1, and C = 1

a)

0

b)

1

27.

What is the output Z of this logic cricuit if A = 1 and B = 1

a)

0

b)

1

28.

Which property: A+B = B+A or A * B = B*A

a)

Associative

b)

Distributive

c)

Commutative

d)

Bermuda Triangle

29.

Who wrote this law: ~ (A + B) = ~A * ~B

a)

Boole

b)

Euler

c)

DeMorgan

d)

Wolfertz

30.
Boolean algebra expressions are simplified because...
a)
Circuits are then cheaper to build
b)
Circuits are more logically correct
c)
More gates are used
31.

Which gate does this symbol represent?

a)

AND

b)

NOT

c)

OR

d)

NAND

32.

Which gate does this symbol represent?

a)

NOT

b)

AND

c)

OR

d)

NOR

33.
According to Boolean algebra theorems x.x is equal to
a)
x
b)
1
c)
0
d)
x'
34.
__________ is elementary building block of a digital circuit that manipulates the binary information
a)
binary numbers
b)
logic gate
35.
What is the boolean expression shown here :   
a)
(a+b)'+b+c'
b)
(a.b)'.b.c'
c)
(a.b)'+b+c'
d)
(a+b)+b'+c
36.
Which of these is considered universal gate
a)
AND
b)
NOT
c)
XOR
d)
NOR
37.

Evaluate: 2 < 3 And ( Not 3 > 2)

a)

True

b)

False

38.
(NOT A) AND B = Q, If A=0 and B = 1, what does Q equal?
a)
1
b)
0
39.
__     __
A  .   B
is the same as
a)
_______
A + B
b)
A . B
c)
B . A
d)
______
A . B
40.

What is the output?

a)

True

b)

False

41.
(C AND D) OR (NOT(A OR B)) = Q, If A=1, B=1, C=0 and D=1, what does Q equal?
a)
0
b)
1
42.

What is the output?

a)

0

b)

1

c)

2

d)

ERROR

43.

What is the output?

a)

0

b)

1

c)

2

d)

ERROR

44.
Digital Signals have how many defined levels?
a.  0
b.  1
c.  2
d.  infinite
a)
A.
b)
B.
c)
C.
d)
D.
45.

Which of the following gate types below is NOT considered a universal gate?

a. XOR

b. NAND

c. NOR

d. None of the above

a)

A.

b)

B.

c)

C.

d)

D.

46.
Which Logic Gate is represented by the expression to the right?
a.  NAND
b.  NOR
c.  AND
d.  OR
a)
A.
b)
B.
c)
C.
d)
D.
47.

3) The boolean expression of an OR gate is _______

a)

a) A.B

b)

b) A’B+AB’

c)

c) A+B

d)

d) A’B’

48.

4) Which of the following gate will give a 0 when both of its inputs are 1?

a)

a) AND

b)

b) OR

c)

c) NAND

d)

d) EXOR

49.

Which Logic Gate is represented by the symbol given in the image?

a. OR

b. XNOR

c. NOR

d. XOR

a)

A.

b)

B.

c)

C.

d)

D.

50.

2) A __________ gate gives the output as 1 only if all the inputs signals are 1.

a)

a) AND

b)

b) OR

c)

c) EXOR

d)

d) NOR

51.
What kind of gate does this Truth Table represent?
a)
XOR
b)
OR
c)
NOT
d)
AND
52.

The Boolean expression Y = (AB)’ is logically equivalent to what single gate?

a)

NAND

b)

NOR

c)

AND

d)

OR

53.

NOR function is dual of

a)

AND function

b)

OR function

c)

XOR function

d)

NAND function

54.

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

a)

A )X = AB

b)

B) X = ABC

c)

C) X = A + B + C

d)

D) X = AB + C

55.

6) Which among the below stated boolean expressions do not obey De-Morgan's theorem ?

a)

a) X+Y = X . Y

b)

b) X.Y = X + Y

c)

c) X.Y = X.Y

d)

d) None of the above

56.

7. The number of min terms for an expression comprising of 3 variables?

a)

a) 8

b)

b) 3

c)

c) 0

d)

d) 1

57.

The NOR gate output will be high if the two inputs are __________

a)

00

b)

01

c)

10

d)

11

58.

……….. input values will cause an AND logic gate to produce a HIGH output.

a)

At least one input is HIGH

b)

At least one input is LOW

c)

All inputs are HIGH

d)

All inputs are LOW

59.

Which of these are logic gates?

a)

AND

b)

OR

c)

NOT

d)

IF

e)

ELSE

60.

What is the output of an AND gate if its inputs are 1 and 1?

a)

1

b)

0

61.

What is the output of an AND gate if its inputs are 1 and 0?

a)

1

b)

0

62.

What is the output of an OR gate if its inputs are 0 and 1?

a)

1

b)

0

63.

Which logic gate does this symbol represent?

a)

AND

b)

OR

c)

NOT

d)

IF

e)

ELSE

64.

What is the output Y of this logic cricuit if A = 1, B = 1, and C = 1

a)

0

b)

1

65.

What is the output Z of this logic cricuit if A = 1 and B = 1

a)

0

b)

1

66.
what is a output
a)
y=0
b)
y=1
67.
what is a output
a)
0
b)
1
68.

What is the output Y of this logic cricuit if A = 1, B = 1, and C = 1

a)

0

b)

1

69.
X . X
a)
0
b)
1
c)
X
d)
__
 X
70.
X + X
a)
0
b)
1
c)
X
d)
__
X
71.
X + 0
a)
X
b)
__
X
c)
0
d)
1
72.
       __
X . X
a)
0
b)
1
c)
X
d)
__
X
73.
A . B 
is the same as
a)
B . A
b)
A . A
c)
B . B
d)
A + B
74.
__     __
A  .   B
is the same as
a)
_______
A + B
b)
A . B
c)
B . A
d)
______
A . B
75.
X . ( Y . Z )
is the same as 
a)
X . Y + Z
b)
( X + Y ) + Z
c)
( X . Y ) . Z
d)
( X . Z ) + Y
76.
A . ( B + C )
is the same as
a)
___________
A + B + C
b)
( A + B ) ( A + C)
c)
A . B . C
d)
( A . B ) + ( A . C )
77.
A . ( B + C )
is the same as
a)
___________
A + B + C
b)
( A + B ) ( A + C)
c)
A . B . C
d)
( A . B ) + ( A . C )
78.
_____
A . B
a)
__    __
A + B
b)
__   __
A . B
c)
( A . B )
d)
( A + B )
79.

How many different combinations of 1 and 0 are possible with 3 bits?

a)

2

b)

4

c)

6

d)

8

80.

A NAND gate is called a universal logic element because

a)

All digital computers use NAND gates

b)

All the minimisation techniques are applicable for optimum NAND gate realisation

c)

Everybody use this gate

d)

Any logic function can be realized by NAND gates alone

81.

If a input signal a=11100 is applicable to a NOT gate ,its output signal is

a)

00011

b)

01001

c)

00011

d)

1000

82.

In Boolean algebra A.A.A.A is equal to

a)

1

b)

A4

c)

4A

d)

A

83.

In Boolean algebra AND is represented by

a)

/

b)

-

c)

×

d)

+

84.

Boolean algebra can be used to

a)

simplify any algebraic expression

b)

Minimize number of switches in a circuit

c)

Solve the mathematical problem

d)

perform arithmetic calculation

85.

NAND gate means

a)

Inversion followed by AND gates

b)

AND gates followed by an inverter

c)

AND gate followed by an OR Gate

d)

None

86.

In Boolean Algebra A + 1 =?

a)

0

b)

1

c)

A

d)

None

87.

According to the associative law of addition,

a)

A + B = B + A

b)

A = A + A

c)

(A + B) + C = A + (B + C )

d)

A + 0 = A

88.

Associative Law states that

a)

X + (Y+Z)= (X+Y ) + Z

b)

X.(YZ) =(XY).Z

c)

X + Y = Y +X

d)

XYZ.XYZ = XYZ

89.

Which property: A+B = B+A or A * B = B*A

a)

Associative

b)

Distributive

c)

Commutative

d)

Bermuda Triangle

90.

A + 0 =

a)

A

b)

1

c)

0

d)

My little pony

e)

~A

91.

A + 1 =

a)

1

b)

0

c)

A

d)

A pair of smelly sneakers

e)

~A

92.

A + ~A =

a)

A

b)

1

c)

0

d)

A purple rock

93.

A + A =

a)

0

b)

A

c)

1

d)

A poisonous dart frog

94.

(1 + A + A) =

a)

A

b)

~A

c)

1

d)

0

e)

Dirty dishes

95.

(1 + A + B) =

a)

A

b)

~A

c)

B

d)

~B

e)

1

96.

A * 0 =

a)

A

b)

~A

c)

1

d)

0

e)

LA Dodgers

97.

~A + 1 =

a)

A

b)

~A

c)

1

d)

0

e)

Silly string

98.

A * (B + C) = A* B + A * C

a)

Commutative Property

b)

Associative Property

c)

Distributive Property

d)

No one's property

99.

Which of the following is a binary code?

a)

10010110

b)

a + b = c;

c)

E = mc2

d)

int a = 5;