Question 1

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

Accepted Answer

A)  (A + 
B) (C + 
D)  
B)  AB(C
D)  
C)  AB + CD 
D)  (A
B) (C
D)  
A)  (A + 
B) (C + 
D)  
B)  AB(C
D)  
C)  AB + CD 
D)  (A
B) (C
D)

Question 2

-The Boolean expression for the symbol in Figure 4- 2 is _______.

Accepted Answer

A)  X = (A +
B)  (B +
C)  
B)  X = ABCD 
C)  X = A + B + C + D 
D)  X = AB + BC 
A)  X = (A +
B)  (B +
C)  
B)  X = ABCD 
C)  X = A + B + C + D 
D)  X = AB + BC

Question 3

-For the circuit in Figure 4- 1, X = 0 whenever A = 0, regardless of the levels applied to inputs B and C.

Accepted Answer

A) True 
 B)False

Question 4

Reduce the following equation using Boolean Algebra.

Accepted Answer

The answer of Reduce the following equation using Boolean Algebra.
...

Question 5

A Karnaugh map _________ .

Accepted Answer

A)  provides a means of reducing complex Boolean expressions 
B)  gives an overall picture of how the signals flow through the logic circuit 
C)  produces the simplest sum- of- products expression 
D)  allows any circuit to be implemented with just AND and OR gates 
A)  provides a means of reducing complex Boolean expressions 
B)  gives an overall picture of how the signals flow through the logic circuit 
C)  produces the simplest sum- of- products expression 
D)  allows any circuit to be implemented with just AND and OR gates

Question 6

-The symbol shown in Figure 4- 3 is a(n) _______gate.

Accepted Answer

A)  Exclusive- OR 
B)  AND- OR 
C)  AND 
D)  OR 
A)  Exclusive- OR 
B)  AND- OR 
C)  AND 
D)  OR

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

-The Boolean expression for the symbol in Figure 4- 2 is _______.

-For the circuit in Figure 4- 1, X = 0 whenever A = 0, regardless of the levels applied to inputs B and C.

Reduce the following equation using Boolean Algebra.

A Karnaugh map _________ .

-The symbol shown in Figure 4- 3 is a(n) _______gate.

Introductory Concepts

Number Systems, Operations, and Codes

Logic Gates

Combinational Logic Analysis

Functions of Combinational Logic

Latches, Flip-Flops, and Timers

Shift Registers

Counters

Programmable Logic

Data Storage

Signal Conversion and Processing

Data Transmission

Data Processing and Control

Integrated Circuit Technologies

Filters

Exam 4: Boolean Algebra and Logic Simplification

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

-The Boolean expression for the symbol in Figure 4- 2 is _______.

-For the circuit in Figure 4- 1, X = 0 whenever A = 0, regardless of the levels applied to inputs B and C.

Reduce the following equation using Boolean Algebra.

A Karnaugh map _________ .

-The symbol shown in Figure 4- 3 is a(n) _______gate.

Introductory Concepts

Number Systems, Operations, and Codes

Logic Gates

Combinational Logic Analysis

Functions of Combinational Logic

Latches, Flip-Flops, and Timers

Shift Registers

Counters

Programmable Logic

Data Storage

Signal Conversion and Processing

Data Transmission

Data Processing and Control

Integrated Circuit Technologies

Filters