Logic Circuit Simplification MCQs

Question 1

Which of the following expressions is in the sum-of-products (SOP) form?

Accepted Answer

Y=AB + AB

Answer

Y = (A + B)(C + D)

Answer

Y = AB(CD)

Answer

Y= (A + B ) .(A + B )

Question 2

Each "1" entry in a K-map square represents ______________.

Accepted Answer

a HIGH for each input truth table condition that produces a HIGH output

Answer

a HIGH output on the truth table for all input combinations

Answer

a LOW output for all possible HIGH input conditions

Answer

a DON'T CARE condition for all possible input truth table combinations

Question 3

One reason for using the sum-of-products form is that it can be implemented using all ______ gates without much alteration.

Accepted Answer

NAND

Answer

AND

Answer

OR

Answer

NOR

Question 4

When grouping cells within a K-map, the cells must be combined in groups of ________.

Accepted Answer

1, 2, 4, 8, etc.

Answer

2s

Answer

4s

Answer

3s

Question 5

The application of Boolean algebra to the solution of digital logic circuits was first explored by ________ of ________.

Accepted Answer

Claude Shannon, MIT

Answer

George Boole, MIT

Answer

George Boole, Stanford

Answer

Claude Shannon, IBM

Question 6

A Karnaugh map will ____________________.

Accepted Answer

produce the simplest sum-of-products expression

Answer

eliminate the need for tedious Boolean expressions

Answer

allow any circuit to be implemented with just AND and OR gates

Answer

give an overall picture of how the signals flow through the logic circuit