Boolean Algebra and Logic Circuits

This quiz contains multiple-choice problems on fundamental concepts and postulates, Boolean functions, SOP and POS, logic and universal gates.

Start Quiz

The number of values applicable in Boolean algebra is

1

2

3

4

Boolean algebra can deal with any number system. True or false?

True

False

The symbol + in Boolean is also known as the __ operator.

AND

OR

ADD

SUMMATION

Which operator has the highest precedence?

+

.

!

*

Which operator will be evaluated first in the expression Y + X’.Y?

+

.

,

As per the idempotent law, X + X will always be equal to

0

1

X

2X

The expression for the law of involution is

x+y=y+x

x+1=1

(x’)’=x

x.x=x

Who proposed the use of Boolean algebra in the design of relay switching circuits?

George Boole

Claude E. Shannon

Claude E. Boole

George Shannon

We use the truth table to represent Boolean

Functions

Algebra

Operators

Addition

The __ gate outputs or results in the complement of the input.

NOR

AND+NOR

NOT

EX-OR

There are five universal logic gates. True or false?

True

False

How many AND gates are required to realize the following expression Y = AB+BC?

4

8

1

2

The number of outputs in a half adder is

1

2

3

0

The __ gate is an OR gate followed by a NOT gate.

NAND

EXOR

NOR

EXNOR

The Boolean algebraic expression of a NAND gate is

A.B

A’B+AB’

(A.B)’

(A+B)’

Quiz/Test Summary
Title: Boolean Algebra and Logic Circuits
Questions: 15
Contributed by:
Ivan